The class of simple cube-curves whose MLPs cannot have vertices at grid points

DOI10.1007/978-3-540-31965-8_18MaRDI QIDQ5316525zbMATH OpenOpenAlexFDO

Authors Fajie Li, Reinhard Klette

Publication date 13 September 2005

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

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

Mathematics Subject Classification ID

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

Recommendations

• Minimum-length polygon of a simple cube-curve in 3D space
• Approximation of 3D shortest polygons in simple cube curves
• Minimum-length polygons in simple cube-curves
• Two linear-time algorithms for computing the minimum length polygon of a digital contour
• Length estimation in 3-D using cube quantization

Cited in

(3)

• Minimum-length polygons in simple cube-curves
• Approximation of 3D shortest polygons in simple cube curves
• Minimum-length polygon of a simple cube-curve in 3D space

This page was built for publication: The class of simple cube-curves whose MLPs cannot have vertices at grid points

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