O'Rourke, J., Booth, H. and Washington, R., Connect-the-dots: a new heuristic, Computer Vision, Graphics and Image Processing, 39, (1984), pp. 258-266. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
One-Pass Delaunay Filtering for Homeomorphic 3D Surface.. - Amenta, Choi (1999) (6 citations) (Correct)
....and so far do not have well defined sampling requirements or performance guarantees. They are, however, very fast and robust and are well accepted in practice. There has a been a lot of closely related work on reconstructing curves in the plane using Delaunay triangulation, much of it recent. See [19], 14] 18] 4] 5] 9] 15] and [11] Many of these algorithms come with theoretical guarantees. 3 Good triangles and dense enough sampling In two dimensions, it is clear that the right answer to the reconstruction problem is a piecewise linear curve connecting points that are adjacent ....
O'Rourke, J., Booth, H. and Washington, R., Connect-the-dots: a new heuristic, Computer Vision, Graphics and Image Processing, 39, (1984), pp. 258-266.
The Crust and the Beta-Skeleton: Combinatorial Curve.. - Amenta, Bern, Eppstein (1998) (10 citations) (Correct)
....better filtering algorithms. Ogniewicz [O94] studies the computation of an approximate medial axis from a densely sampled boundary, and uses the approximate medial axis to produce successively simpler representations of the boundary. Similar ideas were used by O Rourke, Booth and Washington [O84], who proposed reconstructing simple closed polygons in the plane from a set of points by choosing a subset of the Delaunay triangulation so as to optimize the approximate medial axis of the resulting polygon. A successful earlier computational geometric approach to defining the shape of a set of ....
O'Rourke, J., Booth, H. and Washington, R., Connect-the-dots: a new heuristic, Computer Vision, Graphics and Image Processing, 39, (1984), pp. 258-266.
Delaunay Reconstruction from Multiaxial Planar Cross-Sections - Dance, Prager (1997) (1 citation) (Correct)
....bring all the points onto the surface of the reconstruction while attempting to minimise surface area. In later papers, these authors started from the Delaunay triangulation (see Section 5. 4) of the points: Boissonnat [4] sculpted to minimise the change in surface area at each step, while O Rourke [43] minimised the length of the Voronoi skeleton (see Section 5.4.3) of the reconstructed object. Eventually, Boissonnat applied the Delaunay triangulation to the reconstruction from parallel contours [5] A clever and efficient procedure for combining the Delaunay triangulation of each section into ....
J. O'Rourke, H. Booth, and R. Washington. Connect-the-dots: a new heuristic. Computer Vision, Graphics and Image Processing, 39:258--266, 1987.
One-Pass Delaunay Filtering for Homeomorphic 3D Surface.. - Amenta, Choi (1999) (6 citations) (Correct)
....so far do not have well defined sampling requirements or performance guarantees. They are, however, very fast and robust and are well accepted in practice. There has a been a lot of closely related work on reconstructing curves in the plane using Delaunay triangulation, much of it recent. See [18], 13] 17] 4] 5] 9] 14] and [11] Many of these algorithms come with theoretical guarantees. 3 Good triangles and dense enough sampling In two dimensions, it is clear that the right answer to the reconstruction problem is a piecewise linear curve connecting points that are adjacent ....
O'Rourke, J., Booth, H. and Washington, R., Connect-the-dots: a new heuristic, Computer Vision, Graphics and Image Processing, 39, (1984), pp. 258-266.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC