Abstract
We describe an area-preserving subdivision schematization algorithm: the area of each region in the input equals the area of the corresponding region in the output. Our schematization is axis-aligned, the final output is a rectilinear subdivision. We first describe how to convert a given subdivision into an area-equivalent rectilinear subdivision. Then we define two area-preserving contraction operations and prove that at least one of these operations can always be applied to any given simple rectilinear polygon. We extend this approach to subdivisions and showcase experimental results. Finally, we give examples for standard distance metrics (symmetric difference, Hausdorff- and Fréchet-distance) that show that better schematizations might result in worse shapes. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Meulemans, W., Van Renssen, A., & Speckmann, B. (2010). Area-preserving subdivision schematization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6292 LNCS, pp. 160–174). https://doi.org/10.1007/978-3-642-15300-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.