Near-quadratic bounds for the L1 Voronoi diagram of moving points

Computational Geometry: Theory and Applications

Volumn 7, Issue 1-2, 1997, Pages 73-80

  Chew, L Paul ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010252061     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00044-5     Document Type: Article

References (9)

1. P.K. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, J. Combin. Theory Ser. A 52 (1989) 228-274.
2. F. Aurenhammer, Voronoi diagrams - a survey of a fundamental geometric data structure, ACM Comput. Surveys 23 (1991) 345-405.
3. L.P. Chew and R.L. Drysdale, Voronoi diagrams based on convex distance functions, in: Proc. 1st Symp. Comput. Geom. (ACM, New York, 1985) 235-244.
4. L.P. Chew and K. Kedem, Placing the largest similar copy of a convex polygon among polygonal obstacles, in: Proc. 5th Symp. Comput. Geom. (ACM, New York, 1989) 167-174.
5. L.P. Chew and K. Kedem, A convex polygon among polygonal obstacles: placement and high-clearance motion, Computational Geometry: Theory and Applications 3 (1993) 59-89.
6. L.P. Chew, K. Kedem, M. Sharir, B. Tagansky and E. Welzl, Voronoi diagrams of lines in 3-space under polyhedral convex distance functions, in: Proc. 6th ACM-SIAM Symp. Discrete Algorithms (1995) 197-204.
7. L. Guibas, J. Mitchell and T. Roos, Voronoi diagrams of moving points in the plane, in: G. Schmidt and R. Berghammer, eds., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 570 (Springer, Berlin, 1992) 113-125.
8. D.P. Huttenlocher, K. Kedem and J.M. Kleinberg, On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane, in: Proc. 8th Symp. Comput. Geom. (ACM, New York, 1992) 110-119.
9. N. Katoh, T. Tokuyama and K. Iwano, On the minimum and maximum spanning trees of linearly moving points, in: Proc. 33rd IEEE Symp. Found. Comp. Sci. (IEEE Computer Society Press, 1992) 396-405.