Sciweavers

COMGEO
2010
ACM
13 years 4 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
COMGEO
2010
ACM
13 years 4 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
COMGEO
2010
ACM
13 years 4 months ago
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
our tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scala...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
COMGEO
2010
ACM
13 years 4 months ago
Highway hull revisited
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
COMGEO
2010
ACM
13 years 4 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
Eric Berberich, Michael Kerber, Michael Sagraloff
COMGEO
2010
ACM
13 years 4 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
COMGEO
2010
ACM
13 years 4 months ago
Mixed volume techniques for embeddings of Laman graphs
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
Reinhard Steffens, Thorsten Theobald
COMGEO
2010
ACM
13 years 4 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
COMGEO
2010
ACM
13 years 4 months ago
Floodlight illumination of infinite wedges
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles 1, . . . , n at n sites p1, . . . , pn...
Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik V...