Simple optimal algorithms for rectilinear link path and polygon separation problems

Parallel Processing Letters

Volumn 9, Issue 1, 1999, Pages 31-42

  Maheshwari, Anil ^a   Sack, Jörg Rüdiger ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

LINK DISTANCE; NESTED POLYGONS; RECTILINEAR LINK PATH; RECTILINEAR POLYGONS;

COMPUTATIONAL GEOMETRY;

EID: 0032635346     PISSN: 02196264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0129626499000062     Document Type: Article

References (2)

1. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri and O.K. Yap, Finding minimal convex nested polygons, Information and Computation, 83 (1989), pp. 98-110.
2. M. de Berg, On rectilinear link distance, Computation Geometry: Theory and Applications, 1 (1991), pp. 13-34.