Non-convex contour reconstruction

DOI10.1016/S0747-7171(08)80063-6MaRDI QIDQ2638822zbMATH OpenOpenAlexFDO

Authors Panagiotis D. Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0747-7171(08)80063-6

zbMATH Keywords

contour reconstructionprobing problemrobot moving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Recommendations

• Reconstruction of polygons from projections
• Probing a scene of nonconvex polyhedra
• Reconstruction of polygonal sets by constrained and unconstrained double probing.
• Non-interactive geometric probing: Reconstruction non-convex polygons
• Probing convex polygons with a wedge

Cites work

• Connect-the-dots: A new heuristic
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• scientific article; zbMATH DE number 4062601 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3562121 (Why is no real title available?)
• Shape from probing

Cited in

(10)

• Reconstruction of polygons from projections
• Probing a scene of nonconvex polyhedra
• Model-based probing strategies for convex polygons
• Algorithms for ordering unorganized points along parametrized curves
• Reconstruction of polygonal sets by constrained and unconstrained double probing.
• An automatic reconstruction method of convex object based on sequence contours
• A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
• Reconstructing polygons from scanner data
• Reconstructing polygons from scanner data
• Learning smooth shapes by probing

This page was built for publication: Non-convex contour reconstruction

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