Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The equipartition of curves

From MaRDI portal
Publication:924088
Jump to:navigation, search

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

zbMATH Keywords

pattern recognitionshape recognitionpolygonal approximationcurve equipartitioncurve segmentationiso-level algorithm


Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)


Related Items

A minimum spanning tree equipartition algorithm for microaggregation



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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:924088&oldid=12890958"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki