Testing simple polygons.

DOI10.1016/S0925-7721(96)00015-6zbMath1133.68459OpenAlexW2063540785WikidataQ56877851 ScholiaQ56877851MaRDI QIDQ2482903

Diane L. Souvaine, Joseph S. B. Mitchell, Esther M. Arkin, David M. Mount, Steven Salzberg, Kathleen Romanik, Patrice Belleville

Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00015-6

zbMATH Keywords

TestingProbingVerifying

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Testing orthogonal shapes ⋮ Exact Learning of Discretized Geometric Concepts ⋮ Structural tolerance and Delaunay triangulation

Cites Work

• Testing geometric objects
• Testing orthogonal shapes
• Approximate testing and its relationship to learning
• Probing polygons minimally is hard
• Shape from probing
• Unnamed Item

This page was built for publication: Testing simple polygons.