Non-convex contour reconstruction

DOI10.1016/S0747-7171(08)80063-6zbMATH Open0717.68098OpenAlexW2015816463MaRDI QIDQ2638822FDOQ2638822

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

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

zbMATH Keywords

contour reconstructionprobing problemrobot moving

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shape from probing
• Connect-the-dots: A new heuristic
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes

Cited In (9)

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

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)