140 search results - page 15 / 28 » Computing the visibility graph of points within a polygon |
SMA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
TVCG
2002
14 years 11 months ago
2002
Elliptical weighted average (EWA) surface splatting is a technique for high quality rendering of point-sampled 3D objects. EWA surface splatting renders water-tight surfaces of co...
102
click to vote
ICPR
2000
IEEE
16 years 23 days ago
2000
IEEE
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
107
click to vote
GD
1997
Springer
15 years 3 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
CONEXT
2009
ACM
15 years 24 days ago
2009
ACM
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...