Voronoi Diagrams on orbifolds

Computational Geometry - Tập 8 - Trang 219-230 - 1997
M. Mazón1, T. Recio1
1Dpto. Matemáticas, Estadística y Computación, Universidad de Cantabria, Santander 39071, Spain

Tài liệu tham khảo

Aurenhammer, 1991, Voronoi Diagrams — A Survey of a Fundamental Geometric Data Structure, ACM Comp. Surveys, 23, 10.1145/116873.116880 Berger, 1987 Brown, 1980, Geometric transforms for fast geometric algorithms Coxeter, 1961 Coxeter, 1972 Dehne, 1987, An optimal algorithm for computing the Voronoi Diagram on a cone Ehrlich, 1979, Dirichlet regions in manifolds without conjugate points, Comment. Math. Helvetici, 54, 642, 10.1007/BF02566298 Fortune, 1987, A sweepline algorithm for Voronoi Diagrams, Algorithmica, 2, 153, 10.1007/BF01840357 Klein, 1990, On the construction of abstract Voronoi diagrams, Vol. 450, 138 Martin, 1982 Mazón, 1992, Diagramas de Voronoi en caleidoscopios Montesinos, 1987 Mount, 1985, Voronoi Diagrams on the surface of a polyhedron, 10.21236/ADA166220 Nikulin, 1987, Geometries and Groups Schattschneider, 1978, The plane symmetry groups: Their recognition and notation, Amer. Math. Monthly, 85, 439, 10.2307/2320063 Shamos, 1975, Closest-point problems, 151 Wolf, 1974, Spaces of Constant Curvature