Sciweavers

2183 search results - page 43 / 437
» Multi-pass geometric algorithms
Sort
View
COMPGEOM
2001
ACM
14 years 1 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
GIS
2008
ACM
13 years 11 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans
STOC
2001
ACM
132views Algorithms» more  STOC 2001»
14 years 10 months ago
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
Ravi Montenegro, Jung-Bae Son
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 4 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
14 years 3 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger