Simplification of 2D Polygonal Partitions via Point‐line Projective Duality, and Application to Urban Reconstruction
| dc.contributor.author | Vuillamy, J. | en_US |
| dc.contributor.author | Lieutier, A. | en_US |
| dc.contributor.author | Lafarge, F. | en_US |
| dc.contributor.author | Alliez, P. | en_US |
| dc.contributor.editor | Hauser, Helwig and Alliez, Pierre | en_US |
| dc.date.accessioned | 2022-10-11T05:24:58Z | |
| dc.date.available | 2022-10-11T05:24:58Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We address the problem of simplifying two‐dimensional polygonal partitions that exhibit strong regularities. Such partitions are relevant for reconstructing urban scenes in a concise way. Preserving long linear structures spanning several partition cells motivates a point‐line projective duality approach in which points represent line intersections, and lines possibly carry multiple points. We propose a simplification algorithm that seeks a balance between the fidelity to the input partition, the enforcement of canonical relationships between lines (orthogonality or parallelism) and a low complexity output. Our methodology alternates continuous optimization by Riemannian gradient descent with combinatorial reduction, resulting in a progressive simplification scheme. Our experiments show that preserving canonical relationships helps gracefully degrade partitions of urban scenes, and yields more concise and regularity‐preserving meshes than common mesh‐based simplification approaches. | en_US |
| dc.description.number | 6 | |
| dc.description.sectionheaders | Major Revision from EG Symposium on Geometry | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 41 | |
| dc.identifier.doi | 10.1111/cgf.14511 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 379-393 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14511 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14511 | |
| dc.publisher | © 2022 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd. | en_US |
| dc.subject | polygonal partition | |
| dc.subject | simplification | |
| dc.subject | projective duality | |
| dc.subject | optimization | |
| dc.subject | urban reconstruction | |
| dc.title | Simplification of 2D Polygonal Partitions via Point‐line Projective Duality, and Application to Urban Reconstruction | en_US |