A unifying approach for a class of problems in the computational geometry of polygons

DOI10.1007/BF01898356zbMath0618.68039OpenAlexW1995403673MaRDI QIDQ1822499

Yanyan Li

Publication date: 1985

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01898356

zbMATH Keywords

monotonicitydistanceVoronoi diagramlocalitycomputational geometryintersectionsimple planar polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Finding a closet visible vertex pair between two polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum vertex distance between separable convex polygons
• Triangulating a simple polygon
• Algorithms for Reporting and Counting Geometric Intersections
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• Computing the extreme distances between two convex polygons
• Generalization of Voronoi Diagrams in the Plane
• Plane-sweep algorithms for intersecting geometric figures

This page was built for publication: A unifying approach for a class of problems in the computational geometry of polygons