de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Curve reconstruction: Connecting dots with good reason

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44305

Dey,  Tamal K.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45255

Ramos,  Edgar A.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Dey, T. K., Mehlhorn, K., & Ramos, E. A. (1999). Curve reconstruction: Connecting dots with good reason. In Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99) (pp. 197-206). New York, USA: ACM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-356C-9
Abstract
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers present algorithms that come with a guarantee: Given a sufficiently dense sample of a closed smooth curve, the algorithms construct the correct polygonal reconstruction. Nothing is claimed about the output of the algorithms, if the input is not a dense sample of a closed smooth curve, e.g., a sample of a curve with endpoints. We present an algorithm that comes with a guarantee for any set $P$ of input points. The algorithm constructs a polygonal reconstruction $G$ and a smooth curve $\Gamma$ that justifies $G$ as the reconstruction from $P$.