MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES

DOI10.1142/S0218195994000045zbMath0805.68061OpenAlexW2117580455MaRDI QIDQ4292528

John Adegeest, Jack Scott Snoeyink, Mark H. Overmars

Publication date: 26 January 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195994000045

zbMATH Keywords

VLSI designshortest pathsdata structurelink metric

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (3)

Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Minimum-link paths revisited ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains

This page was built for publication: MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES