Minimum-length polygons in approximation sausages

DOI10.1007/3-540-45129-3_8MaRDI QIDQ4530817zbMATH OpenFDO

Authors Yasuyuki Kawamura, Reinhard Klette, Koji Obokata, Tetsuo Asano

Publication date 9 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45129-3_8

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 2079748
• On the minimality of polygon triangulation
• Approximation for minimum triangulation of convex polyhedra
• The complexity of computing minimum separating polygons
• Minimum area circumscribing polygons
• Lower bounds for approximate polygon decomposition and minimum gap
• On Minimal Perimeter Polyminoes
• scientific article; zbMATH DE number 2080989
• Inpolygons of minimal diameter
• Approximation of a closed polygon with a minimum number of circular arcs and line segments

Cited in

(5)

• The sausage conjecture holds for convex hulls of moderately bent sausages
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Monotonic sampling of a continuous closed curve with respect to its Gauss digitization: application to length estimation
• Non-local estimators: a new class of multigrid convergent length estimators
• Curvature estimation along noisy digital contours by approximate global optimization

This page was built for publication: Minimum-length polygons in approximation sausages

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