Sweeping an oval to a vanishing point

DOI10.1016/J.DAM.2011.05.003MaRDI QIDQ642967zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Minghui Jiang

Publication date 27 October 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.05.003

zbMATH Keywords

approximation algorithmconvex polygonsweep-linefigure of constant width

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Recommendations

• Sweeping Points
• Sweeping points
• Sweeping costs of planar domains
• Optimum sweeps of simple polygons with two guards
• Optimum sweeps of simple polygons with two guards

Cites work

• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• Minimum-perimeter enclosures
• Sweeping points

Cited in

(3)

• Sweeping Points
• Sweeping points
• Sweeping costs of planar domains

This page was built for publication: Sweeping an oval to a vanishing point

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