Sweeping an oval to a vanishing point

DOI10.1016/J.DAM.2011.05.003zbMATH Open1230.68205OpenAlexW2117450609MaRDI QIDQ642967FDOQ642967

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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)