Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
description / endescription / en
 
scientific article; zbMATH DE number 5345259
Property / DOI
 
Property / DOI: 10.1007/s00453-017-0389-y / rank
Normal rank
 
Property / title
 
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (English)
Property / title: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1145.68554 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/11682462_12 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-017-0389-Y / rank
 
Normal rank
Property / published in
 
Property / published in: LATIN 2006: Theoretical Informatics / rank
 
Normal rank
Property / publication date
 
18 September 2008
Timestamp+2008-09-18T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 18 September 2008 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5345259 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105401484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest-point queries with geometric and combinatorial constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making data structures persistent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: The farthest point Delaunay triangulation minimizes angles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Geometry in C / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank

Latest revision as of 06:10, 28 December 2024

scientific article; zbMATH DE number 5345259
  • Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Language Label Description Also known as
English
Data structures for halfplane proximity queries and incremental Voronoi diagrams
scientific article; zbMATH DE number 5345259
  • Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Statements

Data structures for halfplane proximity queries and incremental Voronoi diagrams (English)
0 references
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
11 January 2019
0 references
18 September 2008
0 references
Voronoi diagrams
0 references
data structures
0 references
trees
0 references
flarbs
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references