Non-interactive geometric probing: Reconstruction non-convex polygons

DOI10.1016/S0925-7721(99)00039-5MaRDI QIDQ1969595zbMATH OpenOpenAlexFDO

Authors Kevin D. Hunter, Theo Pavlidis

Publication date 22 October 2000

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(99)00039-5

zbMATH Keywords

computational geometrygeometric probinglaser scannerpolygon reconstruction

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

The problem of characterizing polygonal shapes that can be reconstructed from a class of scanners that have asymmetric resolution is discussed. The methodology of non-interactive probing is used. The results apply both to concave and convex polygons, as well to polygons containing holes.

Recommendations

• Reconstruction of polygonal sets by constrained and unconstrained double probing.
• Reconstruction of polygons from projections
• Reconstructing polygons from scanner data
• Probing a scene of nonconvex polyhedra
• Reconstructing polygons from scanner data

Cited in

(7)

• Model-based probing strategies for convex polygons
• Reconstruction of polygonal sets by constrained and unconstrained double probing.
• Nonasymptotic densities for shape reconstruction
• Reconstructing polygons from X-rays
• Non-convex contour reconstruction
• Reconstructing polygons from scanner data
• Reconstructing polygons from scanner data

This page was built for publication: Non-interactive geometric probing: Reconstruction non-convex polygons

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