Voronoi diagrams—a survey of a fundamental geometric data structure
暂无分享,去创建一个
[1] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.
[2] Narendra Ahuja,et al. Dot Pattern Processing Using Voronoi Neighborhoods , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] A. Lingus,et al. The Greedy and Delaunay Triangulations are Not Bad in the Average Case , 1986, Inf. Process. Lett..
[4] David M. Mount,et al. Globally-Equiangular triangulations of co-circular points in 0(n log n) time , 1988, SCG '88.
[5] D. T. Lee,et al. Location of Multiple Points in a Planar Subdivision , 1979, Inf. Process. Lett..
[6] Alok Aggarwal,et al. Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.
[7] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[8] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..
[9] Sabine Stifter,et al. An Axiomatic Approach to Voronoi-Diagrams in 3D , 1991, J. Comput. Syst. Sci..
[10] Jean-Daniel Boissonnat,et al. The hierarchical representation of objects: the Delaunay tree , 1986, SCG '86.
[11] Hans Rohnert. Moving Discs Between Polygons , 1988, ICALP.
[12] F. Aurenhammer. Linear combinations from power domains , 1988 .
[13] David G. Kirkpatrick,et al. A Note on Delaunay and Optimal Triangulations , 1980, Inf. Process. Lett..
[14] R. Seidel. A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .
[15] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[16] W. Brostow,et al. Coordination number in liquid argon , 1975 .
[17] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1989, Discret. Comput. Geom..
[18] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.
[19] Leonidas J. Guibas,et al. Slimming down by adding; selecting heavily covered points , 1990, SCG '90.
[20] Kazuo Murota,et al. IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS , 1984 .
[21] R. Prim. Shortest connection networks and some generalizations , 1957 .
[22] Branko Grünbaum,et al. Tilings with congruent tiles , 1980 .
[23] D. Matula,et al. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .
[24] Carl Gutwin,et al. The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.
[25] Paul Chew,et al. There is a planar graph almost as good as the complete graph , 1986, SCG '86.
[26] Franz Aurenhammer,et al. An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..
[27] J. L Finney,et al. A procedure for the construction of Voronoi polyhedra , 1979 .
[28] B. Boots,et al. Voronoi (Thiessen) polygons , 1987 .
[29] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[30] L. Paul Chew,et al. Guaranteed-Quality Triangular Meshes , 1989 .
[31] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[32] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[33] P. Moran. A note on recent research in geometrical probability , 1966, Journal of Applied Probability.
[34] F. Aurenhammer,et al. On the Peeper's Voronoi diagram , 1991, SIGA.
[35] Bernard Chazelle. How to Search in History , 1983, FCT.
[36] Franz Aurenhammer,et al. A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 , 1987, Discret. Comput. Geom..
[37] E. Bolker,et al. Generalized Dirichlet tessellations , 1986 .
[38] D. A. Field,et al. Implementing Watson's algorithm in three dimensions , 1986, SCG '86.
[39] Steven Fortune. A Fast Algorithm for Polygon Containment by Translation (Extended Abstract) , 1985, ICALP.
[40] Takao Asano,et al. A new point-location algorithm and its practical efficiency: comparison with existing algorithms , 1984, TOGS.
[41] Franz Aurenhammer,et al. Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.
[42] D. T. Lee,et al. Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.
[43] E. B. Matzke,et al. Volume-shape relationships in variant foams A further study of the role of surface forces in three-dimensional cell shape determination , 1946 .
[44] Hartmut Noltemeier,et al. On Separable Clusterings , 1989, J. Algorithms.
[45] Hiroshi Imai,et al. Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..
[46] Jean-Daniel Boissonnat,et al. Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..
[47] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[48] Douglas J. Muder. How Big is an n-Sided Voronoi Polygon? , 1990 .
[49] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[50] Tetsuo Asano,et al. Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.
[51] Frank K. Hwang,et al. An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.
[52] D. H. McLain,et al. Two Dimensional Interpolation from Random Data , 1976, Comput. J..
[53] W. Whiteley. Realizability of Polyhedra , 1979 .
[54] Alok Aggarwal,et al. Finding k Points with Minimum Diameter and Related Problems , 1991, J. Algorithms.
[55] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[56] Erik Brisson,et al. Representing geometric structures in d dimensions: topology and order , 1989, SCG '89.
[57] David Eppstein,et al. Finding the k Smallest Spanning Trees , 1990, BIT.
[58] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..
[59] B. Fox,et al. Construction of Voronoi Polyhedra , 1978 .
[60] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .
[61] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[62] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[63] Pravin M. Vaidya. Geometry helps in matching , 1988, STOC '88.
[64] Herbert Edelsbrunner,et al. An acyclicity theorem for cell complexes in d dimensions , 1989, SCG '89.
[65] Robert Williams. Space-Filling Polyhedron: Its Relation to Aggregates of Soap Bubbles, Plant Cells, and Metal Crystallites , 1968, Science.
[66] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[67] Rolf Klein,et al. Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.
[68] D. V. Little. A third note on recent research in geometrical probability , 1974, Advances in Applied Probability.
[69] Chak-Kuen Wong,et al. Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..
[70] Michael B. Dillencourt,et al. Toughness and Delaunay triangulations , 1987, SCG '87.
[71] Bernard Chazelle,et al. An Improved Algorithm for Constructing k th-Order Voronoi Diagrams , 1987, IEEE Trans. Computers.
[72] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.
[73] Franz Aurenhammer,et al. Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra , 1987, J. Symb. Comput..
[74] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[75] Mark H. Overmars,et al. Dynamization of Order Decomposable Set Problems , 1981, J. Algorithms.
[76] Robert L. Scot Drysdale,et al. Voronoi diagrams based on convex distance functions , 1985, SCG '85.
[77] Hans-Christoph Im Hof,et al. Dirichlet regions in manifolds without conjugate points , 1979 .
[78] Robert L. Scot Drysdale,et al. A practical algorithm for computing the Delaunay triangulation for convex distance functions , 1990, SODA '90.
[79] Arne Maus,et al. Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.
[80] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[81] D. T. Lee,et al. Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..
[82] Boris Aronov. On the geodesic Voronoi diagram of point sites in a simple polygon , 1987, SCG '87.
[83] Raimund Seidel,et al. Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.
[84] Ludwig August Seeber. Recension der "Untersuchungen über die Eigenschaften der positiven ternären quadratischen Formen von Ludwig August Seeber". , 1840 .
[85] Der-Tsai Lee. On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.
[86] Micha Sharir,et al. The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis , 2011, Discret. Comput. Geom..
[87] Lenhart K. Schubert,et al. An optimal algorithm for constructing the Delaunay triangulation of a set of line segments , 1987, SCG '87.
[88] Kevin Q. Brown,et al. Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..
[89] Robin Sibson,et al. Locally Equiangular Triangulations , 1978, Comput. J..
[90] Franz Aurenhammer,et al. The Post Office Problem for Fuzzy Point Sets , 1991, Workshop on Computational Geometry.
[91] L. Bieberbach,et al. Über die Bewegungsgruppen der Euklidischen Räume (Zweite Abhandlung.) Die Gruppen mit einem endlichen Fundamentalbereich , 1912 .
[92] F. Preparata. Steps into Computational Geometry , 1977 .
[93] G. Alexanderson,et al. Simple Partitions of Space , 1978 .
[94] Bernard Chazelle,et al. Computing the Largest Empty Rectangle , 1984, SIAM J. Comput..
[95] J. Goodisman,et al. Voronoi cells: An interesting and potentially useful cell model for interpreting the small‐angle scattering of catalysts , 1983 .
[96] Derick Wood,et al. Voronoi Diagrams Based on General Metrics in the Plane , 1988, STACS.
[97] Michael B. Dillencourt,et al. A Non-Hamiltonian, Nondegenerate Delaunay Triangulation , 1987, Inf. Process. Lett..
[98] Tohru Ogawa,et al. A new algorithm for three-dimensional voronoi tessellation , 1983 .
[99] Georges Voronoi. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier mémoire. Sur quelques propriétés des formes quadratiques positives parfaites. , 1908 .
[100] Hiroshi Imai,et al. Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams , 1990, SCG '90.
[101] Chak-Kuen Wong,et al. On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..
[102] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[103] Rex A. Dwyer. Higher-dimensional voronoi diagrams in linear expected time , 1991, Discret. Comput. Geom..
[104] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[105] Richard J. Kopec. AN ALTERNATIVE METHOD FOR THE CONSTRUCTION OF THIESSEN POLYGONS , 1963 .
[106] Robin Sibson,et al. The Dirichiet Tessellation as an Aid in Data Analysis , 1980 .
[107] W. A. Johnson. Reaction Kinetics in Processes of Nucleation and Growth , 1939 .
[108] T. Kiang. RANDOM FRAGMENTATION IN TWO AND THREE DIMENSIONS. , 1966 .
[109] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[110] Denis Mollison,et al. Spatial Contact Models for Ecological and Epidemic Spread , 1977 .
[111] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[112] A. L. Loeb. A systematic survey of cubic crystal structures , 1970 .
[113] D. T. Lee,et al. Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[114] J. Maxwell,et al. XLV. On reciprocal figures and diagrams of forces , 1864 .
[115] Leonidas J. Guibas,et al. Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..
[116] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..
[117] G. L. Dirichlet. Über die Reduction der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. , 1850 .
[118] R. Sokal,et al. A New Statistical Approach to Geographic Variation Analysis , 1969 .
[119] Micha Sharir,et al. Intersection and Closest-Pair Problems for a Set of Planar Discs , 1985, SIAM J. Comput..
[120] Franz Aurenhammer,et al. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams , 1992, Int. J. Comput. Geom. Appl..
[121] Otfried Cheong. Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract) , 1989, STACS.
[122] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..
[123] Richard Cole,et al. Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version) , 1990, ICALP.
[124] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..
[125] Vitit KANTABUTRA,et al. Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals , 1983, Inf. Process. Lett..
[126] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[127] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..
[128] Oiva Tuominen. Das Einflussgebiet der stadt turku : im system der Einflussgebiete Sw-Finnlands , 1949 .
[129] Adrian Baddeley,et al. A fourth note on recent research in geometrical probability , 1977 .
[130] G. Toussaint,et al. On Geometric Algorithms that use the Furthest-Point Voronoi Diagram , 1985 .
[131] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[132] B. Boots. Weighting Thiessen Polygons , 1980 .
[133] Franz Aurenhammer. A relationship between Gale transforms and Voronoi diagrams , 1990, Discret. Appl. Math..
[134] Anita Liu Chow. Parallel algorithms for geometric problems , 1980 .
[135] Franz Aurenhammer,et al. Geometric Relations Among Voronoi Diagrams , 1987, STACS.
[136] Charles S. Peskin,et al. On the construction of the Voronoi mesh on a sphere , 1985 .
[137] Georges Voronoi. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .
[138] A. H. Thiessen. PRECIPITATION AVERAGES FOR LARGE AREAS , 1911 .
[139] Douglas J. Muder,et al. Putting the best face on a Voronoi polyhedron , 1988 .
[140] Narendra Ahuja,et al. DOT PATTERN PROCESSING USING VORONOI POLYGONS AS NEIGHBORHOODS. , 1980 .
[141] C. A. Rogers,et al. Packing and Covering , 1964 .
[142] Klaus H. Hinrichs,et al. A Sweep Algorithm for the All-Nearest-Neighbors Problem , 1988, Workshop on Computational Geometry.
[143] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.
[144] Cyril Stanley Smith,et al. The Shape of Things , 2019 .
[145] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.
[146] Frank Dehne,et al. A computational geometry approach to clustering problems , 1985, SCG '85.
[147] Franz Aurenhammer,et al. Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..
[148] Peter Forbes Rowat,et al. Representing spatial experience and solving spatial problems in a simulated robot environment , 1979 .
[149] Fionn Murtagh,et al. A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..
[150] Micha Sharir,et al. On the shortest paths between two convex polyhedra , 2018, JACM.
[151] Atsuo Suzuki,et al. APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM , 1986 .
[152] C. Lawson. Software for C1 Surface Interpolation , 1977 .
[153] Peter M. Gruber,et al. Facet-to-facet Implies Face-to-face , 1989, Eur. J. Comb..
[154] Michael B. Dillencourt. Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations , 1987, Inf. Process. Lett..
[155] Adrian Bowyer,et al. Computing Dirichlet Tessellations , 1981, Comput. J..
[156] Ketan Mulmuley,et al. On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..
[157] R. E. Miles. On the homogeneous planar Poisson point process , 1970 .
[158] John Fairfield,et al. Segmenting Dot Patterns by Voronoi Diagram Concavity , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[159] H. Blum. Biological shape and visual science (part I) , 1973 .
[160] R Gambini. A COMPUTER PROGRAM FOR CALCULATING LINES OF EQUILIBRIUM BETWEEN MULTIPLE CENTERS OF ATTRACTION , 1968 .
[161] Kenneth L. Clarkson. Further applications of random sampling to computational geometry , 1986, STOC '86.
[162] Raimund Seidel,et al. Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..
[163] Vladislav Babenko. On the optimal error bound for cubature formulae on certain classes of continuous functions , 1977 .
[164] Herbert Edelsbrunner,et al. Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..
[165] ELKE KOCH,et al. Wirkungsbereichspolyeder und Wirkungsbereichsteilungen zu kubischen Gitterkomplexen mit weniger als drei Freiheitsgraden , 1973 .
[166] Leonidas J. Guibas,et al. The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..
[167] Leonidas J. Guibas,et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..
[168] Klaus H. Hinrichs,et al. Plane-Sweep Solves the Closest Pair Problem Elegantly , 1988, Inf. Process. Lett..
[169] Otfried Cheong,et al. Euclidean minimum spanning trees and bichromatic closest pairs , 1991, Discret. Comput. Geom..
[170] D. Weaire,et al. Soap, cells and statistics – random patterns in two dimensions , 1984 .
[171] B. Delaunay. Neue Darstellung der geometrischen Kristallographie , 1933 .
[172] Herbert Edelsbrunner,et al. On the Number of Line Separations of a Finite Set in the Plane , 1985, J. Comb. Theory, Ser. A.
[173] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[174] Bruce Randall Donald,et al. Simplified Voronoi diagrams , 1987, SCG '87.
[175] Atsuyuki Okabe,et al. The Statistical Analysis of a Distribution of Activity Points in Relation to Surface-Like Elements , 1988 .
[176] Kurt Mehlhorn,et al. On the construction of abstract voronoi diagrams , 1990, STACS.
[177] David B. Arnold,et al. The Use of Voronoi Tessellations in Processing Soil Survey Results , 1984, IEEE Computer Graphics and Applications.
[178] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[179] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[180] Leonidas J. Guibas,et al. Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[181] I. G. Gowda,et al. Dynamic Voronoi diagrams , 1983, IEEE Trans. Inf. Theory.
[182] R. Sibson. A vector identity for the Dirichlet tessellation , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.
[183] Micha Sharir,et al. A new efficient motion-planning algorithm for a rod in polygonal space , 1986, SCG '86.
[184] Andrzej Lingas. Voronoi Diagrams with Barriers and the Shortest Diagonal Problem , 1989, Inf. Process. Lett..
[185] Kazuo Murota,et al. A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing , 1984, Inf. Process. Lett..
[186] Kozo Matsushima. Matsushima and Ohta Laboratories, Institute of Engineering Mechanics, University of Tsukuba , 1986, Adv. Robotics.
[187] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..
[188] D. Mount. Voronoi Diagrams on the Surface of a Polyhedron. , 1985 .
[189] Leonidas J. Guibas,et al. Points and triangles in the plane and halving planes in space , 1991, Discret. Comput. Geom..
[190] W. Nowacki. Der Begriff „Voronoischer Bereich“ , 1933 .
[191] Chee Yap,et al. Algorithmic aspects of motion planning: Part 2 , 1990 .
[192] L. M. Orive,et al. Distortion of certain Voronoi tesselations when one particle moves , 1979, Journal of Applied Probability.
[193] Klara Kedem,et al. Placing the largest similar copy of a convex polygon among polygonal obstacles , 1989, SCG '89.
[194] G. C. Shephard,et al. Tilings and Patterns , 1990 .
[195] J. Besag. Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .
[196] David M. Mount. Storing the subdivision of a polyhedral surface , 1987, Discret. Comput. Geom..
[197] F. Thorne,et al. Geometry of Numbers , 2017, Algebraic Number Theory.
[198] Christian Lantuéjoul,et al. Geodesic methods in quantitative image analysis , 1984, Pattern Recognit..
[199] John D. Radke,et al. On the Shape of a Set of Points , 1988 .
[200] Ian K. Crain,et al. The Monte-Carlo generation of random polygons , 1978 .
[201] Alok Aggarwal,et al. Fining k points with minimum spanning trees and related problems , 1989, SCG '89.
[202] J. Linhart. Die Beleuchtung Von Kugeln , 1981 .
[203] Hermann A. Maurer,et al. A Note on Euclidean Near Neighbor Searching in the Plane , 1979, Inf. Process. Lett..
[204] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[205] V. Klee. On the complexity ofd- dimensional Voronoi diagrams , 1979 .
[206] N. J. A. Sloane,et al. Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.
[207] J. Wrench. Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .
[208] B.,et al. Halfspace Range Search : An Algorithmic Application of k-Sets , 2022 .
[209] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[210] E. Wigner,et al. On the Constitution of Metallic Sodium. II , 1933 .
[211] R. BRIGHTMAN,et al. The Shape of Things , 2015 .
[212] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[213] Ugo Montanari,et al. A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.
[214] Boris Aronov,et al. The furthest-site geodesic voronoi diagram , 1993, SCG '88.
[215] A. Brøndsted. An Introduction to Convex Polytopes , 1982 .
[216] Günter Rote,et al. Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane , 1987, ICALP.
[217] W. E. Hartnett,et al. Shape Recognition, Prairie Fires, Convex Deficiencies and Skeletons , 1968 .
[218] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[219] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[220] Samuel Rippa,et al. Minimal roughness property of the Delaunay triangulation , 1990, Comput. Aided Geom. Des..
[221] Glenn K. Manacher,et al. Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation , 1979, Inf. Process. Lett..
[222] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..
[223] A. Tversky,et al. Nearest neighbors and Voronoi regions in certain point processes , 1983, Advances in Applied Probability.
[224] Franz Aurenhammer,et al. A new duality result concerning voronoi diagrams , 1986, ICALP.
[225] P. A. P. Moran,et al. A second note on recent research in geometrical probability , 1969, Advances in Applied Probability.
[226] V. T. Rajan,et al. Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.
[227] J. Kasper,et al. COMPLEX ALLOY STRUCTURES REGARDED AS SPHERE PACKINGS. I. DEFINITIONS AND BASIC PRINCIPLES , 1958 .
[228] Carl W David,et al. Voronoi polyhedra as a tool for studying solvation structure , 1982 .
[229] Alok Aggarwal,et al. Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.
[230] 今井 桂子. Minimax geometric fitting of two corresponding sets of points , 1991 .
[231] M. Shamos. Problems in computational geometry , 1975 .
[232] Kenneth L. Clarkson,et al. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental , 1988, SCG '88.
[233] Ethan D. Bolker,et al. Recognizing Dirichlet tessellations , 1985 .
[234] WERNER NOWACKI. Über allgemeine Eigenschaften von Wirkungsbereichen , 1976 .
[235] Takao Asano,et al. Voronoi Diagram for Points in a Simple Polygon , 1987 .
[236] Raimund Seidel,et al. On the number of faces in higher-dimensional Voronoi diagrams , 1987, SCG '87.
[237] R. Seidel. A Method for Proving Lower Bounds for Certain Geometric Problems , 1984 .
[238] David Eppstein,et al. Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[239] Richard C. T. Lee,et al. Voronoi Diagrams of Moving Points in the Plane , 1990, FSTTCS.
[240] E. Gilbert. Random Subdivisions of Space into Crystals , 1962 .
[241] Pravin M. Vaidya,et al. Minimum Spanning Trees in k-Dimensional Space , 1988, SIAM J. Comput..