26 search results - page 5 / 6 » comgeo 2004 |
126
click to vote
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
112
click to vote
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
112
Voted
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
111
Voted
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
113
click to vote
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...