84 search results - page 9 / 17 » Connected Rectilinear Graphs on Point Sets |
IANDC
2006
13 years 7 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
COMPGEOM
2003
ACM
14 years 18 days ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
SIAMCOMP
2002
13 years 7 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
WG
2010
Springer
13 years 5 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
DAC
1997
ACM
13 years 11 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...