ON THE MATABILITY OF POLYGONS

DOI10.1142/S0218195908002726zbMATH Open1170.65011MaRDI QIDQ3607494FDOQ3607494

Authors: Aya Steiner, Gill Barequet 

Publication date: 2 March 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• Combinatorial reconstruction problems
• Constructing convex 3-polytopes from two triangulations of a polygon
• Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
• A decision algorithm for reversible pairs of polygons
• Reconstructing polygons from scanner data

zbMATH Keywords

tilingsurface reconstructionsurface fittingmatability of polygonsslice interpolation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Inequalities and extremum problems in real or complex geometry (51M16) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• Surface reconstruction between simple polygons via angle criteria
• Approximating Complex Surfaces by Triangulation of Contour Lines
• Optimal surface reconstruction from planar contours
• Piecewise-Linear Interpolation between Polygonal Slices
• ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES
• Surfaces from contours
• Pessimal guesses may be optimal: a counterintuitive search result

Cited In (1)

• On the mating between a polygonal curve and a convex polygon

This page was built for publication: ON THE MATABILITY OF POLYGONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3607494)