The equipartition of curves
From MaRDI portal
Publication:924088
DOI10.1016/j.comgeo.2009.01.003zbMath1178.65025OpenAlexW2011291804MaRDI QIDQ924088
Costas Panagiotakis, Georgios Tziritas, Konstantin Athanassopoulos
Publication date: 27 July 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.003
pattern recognitionshape recognitionpolygonal approximationcurve equipartitioncurve segmentationiso-level algorithm
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A special case of Mahler's conjecture
- Efficiently approximating polygonal paths in three and higher dimensions
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion
- High order approximation of rational curves by polynomial curves
- Polygonal approximation by the minimax method
- The Topology of Square Pegs in Round Holes
- Optimum polygonal approximation of digitized curves
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR