141
Voted
COMGEO
2006
ACM
15 years 23 days 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...
94
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
114
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
110
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
76
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
92
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
123
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
76
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
87
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...