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

How to take short cuts

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

DOI10.1007/BF02293048zbMath0760.52002MaRDI QIDQ1199128

Claire M. Kenyon, Richard W. Kenyon

Publication date: 16 January 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)


zbMATH Keywords

polygonpathrectifiable curveVoronoi polygonshort cut


Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)


Related Items (2)

An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces ⋮ Subsets of rectifiable curves in Hilbert space-the analyst's TSP




Cites Work

  • Rectifiable sets and the traveling salesman problem




This page was built for publication: How to take short cuts

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1199128&oldid=13265049"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki