메뉴 건너뛰기




Volumn 80, Issue 9, 1992, Pages 1471-1484

Construction of the Voronoi Diagram for “One Million” Generators in Single-Precision Arithmetic

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; TOPOLOGY;

EID: 0026922858     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.163412     Document Type: Article
Times cited : (114)

References (22)
  • 1
    • 0023287929 scopus 로고
    • Power diagrams — Properties, algorithms and applications
    • F. Aurenhammer, “Power diagrams — Properties, algorithms and applications” SIAM J. Comput., vol. 16, pp. 78–96, 1987.
    • (1987) SIAM J. Comput. , vol.16 , pp. 78-96
    • Aurenhammer, F.1
  • 2
    • 0024627549 scopus 로고
    • A pyramid data structure for triangle-based surface description
    • L. DeFloriani, “A pyramid data structure for triangle-based surface description,” Computer Graphics and Applications, vol. 9, pp. 67–78, 1989.
    • (1989) Computer Graphics and Applications , vol.9 , pp. 67-78
    • DeFloriani, L.1
  • 3
    • 85034762965 scopus 로고
    • Recipes for geometry and numerical analysis — Part I, An empirical study
    • (Urbana-Champaign), June
    • D. Dobkin and D. Silver, “Recipes for geometry and numerical analysis — Part I, An empirical study,” in Proc. 4th ACM Annual Symp. Computational Geometry (Urbana-Champaign), June 1988, pp. 93–105.
    • (1988) Proc. 4th ACM Annual Symp. Computational Geometry , pp. 93-105
    • Dobkin, D.1    Silver, D.2
  • 5
    • 0020496931 scopus 로고
    • Segmenting dot patterns by Voronoi diagram concavity
    • J. Fairfield, “Segmenting dot patterns by Voronoi diagram concavity,” IEEE Trans. Pattern Anal. Machine Intell., vol. 5, pp. 104–110, 1983.
    • (1983) IEEE Trans. Pattern Anal. Machine Intell. , vol.5 , pp. 104-110
    • Fairfield, J.1
  • 6
    • 52449147685 scopus 로고
    • A sweepline algorithm for Voronoi diagrams
    • S. Fortune, “A sweepline algorithm for Voronoi diagrams,” Algorithmica, vol. 2, pp. 153–174, 1987.
    • (1987) Algorithmica , vol.2 , pp. 153-174
    • Fortune, S.1
  • 7
    • 0024627489 scopus 로고
    • The problems of accuracy and robustness in geometric computation
    • Mar.
    • C. M. Hoffmann, “The problems of accuracy and robustness in geometric computation,” Computer, vol. 22, no. 3, pp. 31-41, Mar. 1989.
    • (1989) Computer , vol.22 , Issue.3 , pp. 31-41
    • Hoffmann, C.M.1
  • 8
    • 84914880672 scopus 로고
    • Constructing the Voronoi diagram in the plane
    • Tech. Rep. SOCS-79.12, School of Computer Science, McGill University, Montreal, Canada
    • R. N. Horspool, “Constructing the Voronoi diagram in the plane,” Tech. Rep. SOCS-79.12, School of Computer Science, McGill University, Montreal, Canada, 1979.
    • (1979)
    • Horspool, R.N.1
  • 9
    • 84942487212 scopus 로고
    • Practical computational methods in geometrical/geographical optimization problems
    • 54 (Proceedings of the X. Symposium on Operations Research, Munchen, 1985), M. J. Beckmann, K.-W. Gaede, K. Ritter, and H. Schneeweiss, Eds. Verlag Anton Hain, Part II
    • M. Iri, “Practical computational methods in geometrical/geographical optimization problems,” in Methods of Operations Research, 54 (Proceedings of the X. Symposium on Operations Research, Munchen, 1985), M. J. Beckmann, K.-W. Gaede, K. Ritter, and H. Schneeweiss, Eds. Verlag Anton Hain, Part II, 1986, pp. 17–37.
    • (1986) Methods of Operations Research , pp. 17-37
    • Iri, M.1
  • 11
    • 0021290720 scopus 로고
    • A fast Voronoi-diagram algorithm with applications to geographical optimization problems
    • 59 (System Modeling and Optimization — Proceedings of the 11th IFIP Conference, Copenhagen, 1983), Springer-Verlag
    • M. Iri, K. Murota, and T. Ohya, “A fast Voronoi-diagram algorithm with applications to geographical optimization problems,” Lecture Notes in Control and Information Sciences, 59 (System Modeling and Optimization — Proceedings of the 11th IFIP Conference, Copenhagen, 1983), Springer-Verlag, 1984, pp. 273–288.
    • (1984) Lecture Notes in Control and Information Sciences , pp. 273-288
    • Iri, M.1    Murota, K.2    Ohya, T.3
  • 13
    • 0013323562 scopus 로고
    • Constructing Delaunay triangulations by merging buckets in quadtree order
    • J. Katajainen and M. Koppinen, “Constructing Delaunay triangulations by merging buckets in quadtree order,” Fundamenta Informaticae, vol. XI, pp. 275–288, 1988.
    • (1988) Fundamenta Informaticae , vol.11 , pp. 275-288
    • Katajainen, J.1    Koppinen, M.2
  • 14
    • 0000029675 scopus 로고
    • Two algorithms for constructing a Delaunay triangulation
    • D. T. Lee and B. J. Schachter, “Two algorithms for constructing a Delaunay triangulation,” Int. J. Computer and Information Sciences, vol. 9, pp. 219–242, 1980.
    • (1980) Int. J. Computer and Information Sciences , vol.9 , pp. 219-242
    • Lee, D.T.1    Schachter, B.J.2
  • 15
    • 0001507613 scopus 로고
    • Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms
    • T. Ohya, M. Iri, and K. Murota, “Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms,” J. Oper. Res. Soc. Japan, vol. 27, pp. 306–336, 1984.
    • (1984) J. Oper. Res. Soc. Japan , vol.27 , pp. 306-336
    • Ohya, T.1    Iri, M.2    Murota, K.3
  • 19
    • 8444233712 scopus 로고
    • Geometric algorithms in finite-precision arithmetic
    • (Tokyo), WE/3K2, (The text presented was printed as Research Memorandum RMI Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo, 1988.)
    • K. Sugihara and M. Iri, “Geometric algorithms in finite-precision arithmetic,” in Abstracts 13th Int. Symp. Mathematical Programming (Tokyo), 1988, WE/3K2, p. 196. (The text presented was printed as Research Memorandum RMI 88–10, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo, 1988.)
    • (1988) Abstracts 13th Int. Symp. Mathematical Programming , pp. 196.
    • Sugihara, K.1    Iri, M.2
  • 20
    • 38249024309 scopus 로고
    • Two design principles of geometric algorithms in finite-precision arithmetic
    • K. Sugihara and M. Iri, “Two design principles of geometric algorithms in finite-precision arithmetic,” Appl. Math. Lett., vol. 2, pp. 203–206, 1989.
    • (1989) Appl. Math. Lett. , vol.2 , pp. 203-206
    • Sugihara, K.1    Iri, M.2
  • 21
    • 6244243808 scopus 로고
    • VORONOI2 reference manual
    • Research Memorandum RMI 89–04, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo
    • K. Sugihara and M. Iri, “VORONOI2 reference manual,” Research Memorandum RMI 89–04, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo, 1989.
    • (1989)
    • Sugihara, K.1    Iri, M.2
  • 22
    • 84942487259 scopus 로고
    • Topology-oriented incremental method for constructing Voronoi diagrams robust against numerical errors
    • Preprint, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo
    • K. Sugihara and M. Iri, “Topology-oriented incremental method for constructing Voronoi diagrams robust against numerical errors” Preprint, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo, 1992.
    • (1992)
    • Sugihara, K.1    Iri, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.