Walking around fat obstacles

Information Processing Letters

Volumn 83, Issue 3, 2002, Pages 135-140

  Chew, L Paul ^a   David, Haggai ^b   Katz, Matthew J ^b   Kedem, Klara ^a,b  

^a School of Operations Research and Information Engineering   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Computational geometry; Fat objects; Short paths

Indexed keywords

BOUNDARY CONDITIONS; DATA PROCESSING; FUNCTIONS; THEOREM PROVING;

FAT OBJECTS;

COMPUTATIONAL GEOMETRY;

EID: 0037119070     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00321-0     Document Type: Article

References (7)

1. Linear size binary space partitions for uncluttered scenes
2. Linear programming in low dimensions
3. 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting, amidst convex fat objects
4. Range searching and point location among fat objects
5. An optimal algorithm for the on-line closest-pair problem