D. F. Watson and G. M. Philip. Systematic triangulations. Comput. Vision, Graphics, Image Process. 26 (1984), 217--223.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Edge Insertion for Optimal Triangulations - Bern, Edelsbrunner, Eppstein.. (1993) (15 citations) (Correct)
....for minmax triangle eccentricity (distance from circumcenter) and most significantly an O(n 3 ) time algorithm for finding a triangulated surface, interpolating given points in 3 , with minmax gradient. All three criteria are mentioned in a survey article on systematic triangulations [WaPh84]. Section 2 formulates the edge insertion paradigm, which locally improves a triangulation according to a generic criterion. When instantiated to a specific criterion, the basic paradigm gives a local optimum in time O(n 8 ) Section 3 states two abstract conditions for quality criteria, the ....
D. F. Watson and G. M. Philip. Systematic triangulations. Comput. Vision, Graphics, Image Process. 26 (1984), 217--223.
Edge Insertion for Optimal Triangulations - Bern, Edelsbrunner, Eppstein.. (1992) (15 citations) (Correct)
....for triangulations with minmax (three dimensional) slope and with minmax eccentricity of any triangle. Triangulations with maxmin height have been suggested for use in surface approximation [GoCR77] and all three criteria have been mentioned in a survey article on systematic triangulations [WaPh84]. Section 2 formulates the most basic version of the edge insertion paradigm, and section 3 gives Edge Insertion for Optimal Triangulations 2 two sufficient conditions for criteria it can optimize. The correctness of the paradigm when applied to such criteria is established in section 4. Section ....
D. F. Watson and G. M. Philip. Systematic triangulations. Comput. Vision, Graphics, Image Process. 26 (1984), 217--223.
Flipping Edges on Triangulations - Hurtado, Noy, Urrutia (1996) (8 citations) (Correct)
.... both because of their intrinsic beauty and for their use in many problems, such as image processing [22] mesh generation for finite element methods [2, 9, 23, 29] scattered data interpolation [15, 18] and many others such as computer graphics, solid modeling and geographical information systems [1, 3, 4, 17, 19, 20, 21, 25, 27, 28]. In this paper we study triangulations of point sets, polygons and polygons with holes on the plane. It is well known that if a polygon Q n is convex, then the diameter of G T (Q n ) is at most 2(n 3) Graphs of triangulations of convex polygons have been studied in [8, 24] If Q n is a ....
Watson, D. F. and G. M. Philips, "Systematic triangulations", Computer Vision, Graphics and Image Processing 26: 217-223, 1984.
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