Sciweavers

WADS
2009
Springer
267views Algorithms» more  WADS 2009»
14 years 4 months ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 4 months ago
New Results on Visibility in Simple Polygons
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
Alexander Gilbers, Rolf Klein
WADS
2009
Springer
237views Algorithms» more  WADS 2009»
14 years 6 months ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine
WADS
2009
Springer
255views Algorithms» more  WADS 2009»
14 years 6 months ago
Plane Graphs with Parity Constraints
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
14 years 6 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 6 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
WADS
2009
Springer
236views Algorithms» more  WADS 2009»
14 years 6 months ago
Inspecting a Set of Strips Optimally
We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given or...
Tom Kamphans, Elmar Langetepe
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
14 years 6 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 6 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos