Sciweavers

1879 search results - page 128 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov
COMPGEOM
1994
ACM
15 years 8 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
POPL
2002
ACM
16 years 4 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
15 years 10 months ago
Terrain generation using genetic algorithms
We propose a method for applying genetic algorithms to create 3D terrain data sets. Existing procedural algorithms for generation of terrain have several shortcomings. The most po...
TeongJoo Ong, Ryan Saunders, John Keyser, John J. ...
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 4 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
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 ...
David Eppstein, Michael T. Goodrich, Darren Strash