Approximation of planar convex sets from hyperplane probes

DOI10.1007/PL00009313MaRDI QIDQ1364138zbMATH OpenFDO

Authors O. Diekmann

Publication date 12 July 2000

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00009313

zbMATH Keywords

geometric probingapproximation of planar convex sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Approximation by convex sets (52A27)

Recommendations

• Probing convex polygons with half-planes
• Model-based probing strategies for convex polygons
• Parallel strategies for geometric probing
• Reconstruction of polygons from projections
• scientific article; zbMATH DE number 177850

Cited in

(9)

• Adaptive sampling for geometric problems over data streams
• Probing a set of hyperplanes by lines and related problems
• A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
• On computing the convex hull of (piecewise) curved objects
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• scientific article; zbMATH DE number 4153914 (Why is no real title available?)
• Shape estimation from support and diameter functions
• Learning smooth shapes by probing
• Lower bounds for \(n\)-term approximations of plane convex sets and related topics

This page was built for publication: Approximation of planar convex sets from hyperplane probes

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