21 search results - page 4 / 5 » comgeo 2006 |
101
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
103
click to vote
COMGEO
1999
ACM
14 years 10 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
110
click to vote
COMGEO
2007
ACM
14 years 11 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
107
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
116
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...