Minimum-length polygons in simple cube-curves

DOI10.1007/3-540-44438-6_38MaRDI QIDQ4471822zbMATH OpenFDO

Authors Reinhard Klette, Thomas Bülow

Publication date 30 July 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1953/19530467.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Combinatorial Image Analysis
• Approximation of 3D shortest polygons in simple cube curves
• Discrete Geometry for Computer Imagery
• Dynamic minimum length polygon
• Length estimation in 3-D using cube quantization

Cited in

(7)

• Length estimation in 3-D using cube quantization
• Approximation of 3D shortest polygons in simple cube curves
• Minimum-length polygons in approximation sausages
• scientific article; zbMATH DE number 6963692 (Why is no real title available?)
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Discrete Geometry for Computer Imagery
• Combinatorial Image Analysis

This page was built for publication: Minimum-length polygons in simple cube-curves

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