A NOTE ON DELAUNAY AND OPTIMAL TRIANGULATIONSKIRKPATRICK DG.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 3; PP. 127-128; BIBL. 4 REF.Article

AN O(N LOG N) ALGORITHM FOR RECTILINEAR MINIMAL SPANNING TREESHWANG FK.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 2; PP. 177-182; BIBL. 7 REF.Article

COMPUTING THE N-DIMENSIONAL DELAUNAY TESSELLATION WITH APPLICATION TO VORONOI POLYTOPESWATSON DF.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 167-172; BIBL. 11 REF.Article

TWO ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATIONLEE DT; SCHACHTER BJ.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 3; PP. 219-242; BIBL. 37 REF.Article

EFFICIENT COMPUTATION OF CONTINUOUS SKELETONSKIRKPATRICK DG.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 18-27; BIBL. 16 REF.Conference Paper

VORONOI DIAGRAMS FROM CONVEX HULLSBROWN KQ.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 223-228; BIBL. 25 REF.Article

SEGMENTING DOT PATTERNS BY VORONOI DIAGRAM CONCAVITYFAIRFIELD J.1983; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; ISSN 0162-8828; USA; DA. 1983; VOL. 5; NO 1; PP. 104-110; BIBL. 19 REF.Article

GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANELEE DT; DRYSDALE RL III.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 73-87; BIBL. 22 REF.Article

TWO-DIMENSIONAL VORONOI DIAGRAMS IN THE L_P-METRICLEE DT.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 604-618; BIBL. 17 REF.Article

Convex hull and voronoi diagram of additively weighted pointsBOISSONNAT, Jean-Daniel; DELAGE, Christophe.Lecture notes in computer science. 2005, pp 367-378, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

ON K-NEAREST NEIGHBOR VORONOI DIAGRAMS IN THE PLANELEE DS.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 6; PP. 478-487; BIBL. 22 REF.Article

MEDIAL AXIS TRANSFORMATION OF A PLANAR SHAPELEE DT.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 4; PP. 363-369; BIBL. 15 REF.Article

Approximation of generalized Voronoi diagrams by ordinary Voronoi diagramsSUGIHARA, K.CVGIP. Graphical models and image processing. 1993, Vol 55, Num 6, pp 522-531, issn 1049-9652Article

Assessing geometric algorithms : some comments arising from the paper fast topological construction of Delaunay triangulations and Voronoi diagrams by Victor J.D. TsaiTIPPER, J.C.Computers & geosciences. 1995, Vol 21, Num 3, pp 433-436, issn 0098-3004Article

LOCATION OF MULTIPLE POINTS IN A PLANAR SUBDIVISIONLEE DT; YANG CC.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 4; PP. 190-193; BIBL. 13 REF.Article

An optimal algorithm for constructing the weighted Voronoi diagram in the planeAURENHAMMER, F; EDELSBRUNNER, H.Pattern recognition. 1984, Vol 17, Num 2, pp 251-257, issn 0031-3203Article

Sur les diagrammes de Delaunay et de Voronoï d'ordre k dans le plan et dans l'espace = On planar and spatial order-k Delaunay and Voronoi diagramsSchmitt, Dominique; Spehner, J.-C.1995, 278 p.Thesis

THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONSLEE DT; PREPARATA FP.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 189-192; BIBL. 4 REF.Article

Improved k-Nearest Neighbor Classifier for Biomedical Data Based on Convex Hull of Inversed Set of PointsSZYMANSKI, Zbigniew; DWULIT, Marek.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7745, issn 0277-786X, isbn 9780819472358, 774510.1-774510.8Conference Paper

A novel computation algorithm of Voronoi diagrams for multiply-connected planar areasQIAN, Bo.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7498, issn 0277-786X, isbn 978-0-8194-7809-2 0-8194-7809-1, 74983M.1-74983M.8, 2Conference Paper

Concrete and abstract Voronoi diagramsKLEIN, Rolf.Lecture notes in computer science. 1989, Vol 400, issn 0302-9743, 167 p.Article

A fast Voronoi-diagram algorithm with quaternary tree bucketingOHYA, T; IRI, M; MUROTA, K et al.Information processing letters. 1984, Vol 18, Num 4, pp 227-231, issn 0020-0190Article

The only correct method to evaluate roundnessKEWEI LAI.Computers & industrial engineering. 1995, Vol 28, Num 1, pp 203-204, issn 0360-8352Article

The incomplete Voronoi diagram and percolation analysisZANINETTI, L.Physics letters. A. 1994, Vol 189, Num 3, pp 167-170, issn 0375-9601Article

Dualisation of Voronoi domains and Klotz construction: a general method for the generation of proper space fillingsKRAMER, P; SCHLOTTMANN, M.Journal of physics. A, mathematical and general. 1989, Vol 22, Num 23, pp L1097-L1102, issn 0305-4470Article