| Lee, D.T., Computational Geometry, ACM Computing Surveys}, Vol. 28(1), 27--31, 1996. |
....included for demonstrations on many browsers also emphasises applications of computational geometry [55] Finally we mention that since 1994 there has appeared a large collection of excellent surveys in both general and specific areas of computational geometry. For examples of general surveys see [40], and [44] On the other hand, a survey of the most recent results in computational geometry most relevant for solving pattern recognition problems, which are themselves intimately related to DIA, has appeared as a chapter in one of the handbooks [48] Another computational geometry topic most ....
Der-Tsai Lee. Computational geometry. In Jr. Allen B. Tucker, editor, The Computer Science and Engineering Handbook, chapter 6. CRC Press, Boca Raton, FL, 1996.
....23 13 16 22 26 27 17 30 8 8 20 20 (b) 19 21 23 16 22 27 17 13 26 20 8 30 (f) Figure 7: Update of hull graph. 3.1 Maxima in 2 and 3 Dimensions In 2 dimensions the problem can be done fairly easily by a plane sweep technique. For a more detailed description of plane sweep technique, see, e.g. [35] or Section 5.1 below. Assume that the set S of points p 1 ; p 2 ; p n are ordered in nondescending order of their x coordinates, i.e. x(p 1 ) x(p 2 ) x(p n ) We shall scan the points from right to left. p n is necessarily a maximal element. As we scan the points, we maintain ....
D. T. Lee, "Computational Geometry," Computer Science and Engineering Handbook, Ed. A. Tucker, CRC Press, 1996, 111-140.
No context found.
Lee, D.T., Computational Geometry, ACM Computing Surveys}, Vol. 28(1), 27--31, 1996.
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