Testing simple polygons.

DOI10.1016/S0925-7721(96)00015-6zbMATH Open1133.68459OpenAlexW2063540785WikidataQ56877851 ScholiaQ56877851MaRDI QIDQ2482903FDOQ2482903

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

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

Recommendations

• Testing geometric objects
• Testing orthogonal shapes
• Does a point lie inside a polygon ?
• Probing convex polygons with half-planes
• Checking the convexity of polytopes and the planarity of subdivisions

zbMATH Keywords

TestingProbingVerifying

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Shape from probing
• Probing polygons minimally is hard
• Testing geometric objects
• Testing orthogonal shapes
• Approximate testing and its relationship to learning

Cited In (4)

• Testing geometric objects
• Structural tolerance and Delaunay triangulation
• Testing orthogonal shapes
• Exact Learning of Discretized Geometric Concepts

This page was built for publication: Testing simple polygons.

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