254 search results - page 44 / 51 » Simplified Voronoi Diagrams |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
APVIS
2011
2011
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
12 years 7 months ago
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...