Distance Fields in Monte Carlo Geometry Processing
| dc.contributor.author | Horváth, Anna Lili | |
| dc.contributor.author | Valasek, Gábor | |
| dc.contributor.author | Bán, Róbert | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2025-07-30T10:28:43Z | |
| dc.date.available | 2025-07-30T10:28:43Z | |
| dc.date.issued | 2025 | |
| dc.description.abstract-translated | We propose to use discrete signed distance representations in Monte Carlo geometry processing simulations. In particular, we investigate the application of algebraic and geometric generalizations of traditional signed distance fields. These are means to unify signed distance and closest point queries that are required by the walk-on-spheres algorithmic framework. We apply these to plane shapes enclosed by parametric polynomial boundaries. Our tests quantify the performance-accuracy trade-off compared to brute force closest point queries on test shapes. | en |
| dc.format | 8 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.doi | http://www.doi.org/10.24132/CSRN.2025-29 | |
| dc.identifier.issn | 2464-4617 (Print) | |
| dc.identifier.issn | 2464-4625 (online) | |
| dc.identifier.uri | http://hdl.handle.net/11025/62239 | |
| dc.language.iso | en | en |
| dc.publisher | Vaclav Skala - UNION Agency | en |
| dc.rights | © Vaclav Skala - UNION Agency | en |
| dc.rights.access | openAccess | en |
| dc.subject | počítačová grafika | cs |
| dc.subject | zpracování geometrie | cs |
| dc.subject | Monte Carlo | cs |
| dc.subject.translated | computer graphics | en |
| dc.subject.translated | geometry processing | en |
| dc.subject.translated | Monte Carlo | en |
| dc.title | Distance Fields in Monte Carlo Geometry Processing | en |
| dc.type | konferenční příspěvek | cs |
| dc.type | conferenceObject | en |
| dc.type.status | Peer reviewed | en |
| dc.type.version | publishedVersion | en |
| local.files.count | 1 | * |
| local.files.size | 6797050 | * |
| local.has.files | yes | * |