Sciweavers

1184 search results - page 72 / 237
» Nearness relations and topology
Sort
View
COMPGEOM
2010
ACM
15 years 5 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
110
Voted
CAD
2006
Springer
15 years 22 days ago
A unified subdivision approach for multi-dimensional non-manifold modeling
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
Yu-Sung Chang, Hong Qin
111
Voted
ICASSP
2010
IEEE
14 years 11 months ago
A symmetric adaptive algorithm for speeding-up consensus
Performing distributed consensus in a network has been an important research problem for several years, and is directly applicable to sensor networks, autonomous vehicle formation...
Daniel Thai, Elizabeth Bodine-Baron, Babak Hassibi
110
Voted
DCG
2010
104views more  DCG 2010»
14 years 10 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
LMCS
2006
79views more  LMCS 2006»
15 years 19 days ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002