A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (English)
- New search for: Bohler, Cecilia
- New search for: Bohler, Cecilia
- New search for: Liu, Chih-Hung
- New search for: Papadopoulou, Evanthia
- New search for: Zavershynskyi, Maksym
In:
Computational geometry
;
59
; 26-38
;
2016
-
ISSN:
- Article (Journal) / Print
-
Title:A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
-
Contributors:
-
Published in:Computational geometry ; 59 ; 26-38
-
Publisher:
- New search for: Elsevier
-
Place of publication:Amsterdam
-
Publication date:2016
-
ISSN:
-
ZDBID:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 31.76 / 31.50
- Further information on Basic classification
- New search for: 535/3155
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 59
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Metric embedding, hyperbolic space, and social networksVerbeek, Kevin / Suri, Subhash et al. | 2016
- 13
-
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theoremGyőri, Ervin / Mezei, Tamás Róbert et al. | 2016
- 26
-
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagramsBohler, Cecilia / Liu, Chih-Hung / Papadopoulou, Evanthia / Zavershynskyi, Maksym et al. | 2016