scientific article; zbMATH DE number 1522924

MaRDI QIDQ4511220zbMATH OpenFDO

Authors Prosenjit Bose, Pat Morin

Publication date 30 October 2000

zbMATH Keywords

Delaunay triangulationsonline routing strategies

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Online Routing in Triangulations
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• scientific article; zbMATH DE number 2080234
• Competitive online routing in geometric graphs
• Upper and lower bounds for online routing on Delaunay triangulations

Cited in

(14)

• Constant memory routing in quasi-planar and quasi-polyhedral graphs
• Competitive online routing in geometric graphs
• Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
• Revisiting hyperbolic Voronoi diagrams in two and higher dimensions from theoretical, applied and generalized viewpoints
• Memoryless routing in convex subdivisions: random walks are optimal
• scientific article; zbMATH DE number 2080234 (Why is no real title available?)
• Online Routing in Triangulations
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• Improved routing on the Delaunay triangulation
• Compact and localized distributed data structures
• On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
• Route discovery with constant memory in oriented planar geometric networks
• Improved routing on the Delaunay triangulation
• On the stabbing number of a random Delaunay triangulation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511220)