Dynamic Voronoi diagram of complex sites

Visual Computer

Volumn 27, Issue 6-8, 2011, Pages 463-472

  Pinto, Francisco De Moura ^a   Freitas, Carla Maria Dal Sasso ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Dynamic; Voronoi diagram

Indexed keywords

COMPLEX SITES; EFFICIENT IMPLEMENTATION; GEOMETRIC STRUCTURE; INCREMENTAL ALGORITHM; SIMPLE ALGORITHM; STATIC POINT; VORONOI DIAGRAMS;

ALGORITHMS; COMPUTATIONAL GEOMETRY;

GRAPHIC METHODS;

EID: 79959531773     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-011-0581-z     Document Type: Article

References (18)

1. Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler, B., Pilgerstorfer, E., Rabl, M.: Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. Theory Appl. 43(8) (2010)
2. Alt, H., Schwarzkopf, O.: The Voronoi diagram of curved objects. In: SCG '95: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 89-97 (1995)
3. Devillers, O.: On deletion in Delaunay triangulations. In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pp. 181-188 (1999)
4. Fischer, I., Gotsman, C.: Fast approximation of high order Voronoi diagrams and distance transforms on the gpu. Tech. Rep. TR-07-05, Harvard University (2005)
5. Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: SCG '86: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313-322 (1986)
6. Gold, C., Remmele, P., Roos, T.: Fully dynamic and kinematic Voronoi diagrams in gis. Algorithmica-Special Issue on Cartography and GIS (1998)
7. P.J. Green R. Sibson 1978 Computing dirichlet tessellations in the plane Comput. J. 21 2 168 173 485467 0377.52001
8. L. Guibas J. Stolfi 1985 Primitives for the manipulation of general subdivisions and the computation of Voronoi ACM Trans. Graph. 4 2 74 123 0586.68059 10.1145/282918.282923
9. Guibas, L.J., Mitchell, J.S.B.: Voronoi diagrams of moving points in the plane. In: WG '91: Proceedings of the 17th International Workshop, pp. 113-125 (1992)
10. M. Held 2001 Voronoi: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments Comput. Geom. 18 2 95 123 1827001 0976.68162 10.1016/S0925-7721(01)00003-7 (Pubitemid 33678406)
11. M. Held S. Huber 2009 Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments Comput. Aided Des. 41 5 327 338 1206.65087 10.1016/j.cad.2008.08.004
12. Hoff, K.E. III, Keyser, J., Lin, M., Manocha, D., Culver, T.: Fast computation of generalized Voronoi diagrams using graphics hardware. In: SIGGRAPH (1999)
13. Imai, T.: A topology oriented algorithm for the Voronoi diagram of polygons. In: Proc. of the 8th Canadian Conference on Computational Geometry, pp. 107-112 (1996)
14. Karavelas, M., Yvinec, M.: A topology oriented algorithm for the Voronoi diagram of polygons. In: European Symposium on Algorithms (2003)
15. Mostafavi, M.A., Gold, C., Dakowicz, M.: Dynamic Voronoi/Delaunay Methods and Applications (2003)
16. Pinto, F.d.M., Freitas, C.M.D.S.: Fast medial axis transform for planar domains with general boundaries. In: SIBGRAPI (2009)
17. Sud, A., Andersen, E., Curtis, S., Lin, M., Manocha, D.: Real-time path planning for virtual agents in dynamic environments. In: SIGGRAPH '08: ACM SIGGRAPH 2008 Classes, pp. 1-9 (2008)
18. C.K. Yap 1987 An o (n log n) algorithm for the Voronoi diagram of a set of simple curve segments Discrete Comput. Geom. 2 365 393 911190 0628.68042 10.1007/BF02187890