Sciweavers

52 search results - page 4 / 11
» Geometric Spanners for Weighted Point Sets
Sort
View
22
Voted
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
14 years 1 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
13 years 8 months ago
Balancing Degree, Diameter and Weight in Euclidean Spanners
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
Shay Solomon, Michael Elkin
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
COMPGEOM
2009
ACM
14 years 2 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
Chuanjiang Luo, Jian Sun, Yusu Wang
WG
2010
Springer
13 years 5 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...