F.F. Yao. Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 7, pages 370--374. Elsevier, Amsterdam, 1990.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computational Geometry on the Grid: Traversal and.. - Schneider, Güting, de .. (1998) (Correct)
....grid and to perform computational geometry in this discrete domain. That is, points, end points of line segments, vertices of polygons, etc. have integer instead of floating point coordinates and lie on grid points. This has led to a subfield called finite resolution [GY86] or finite precision [Yao92] computational geometry dealing with geometry performed on a discrete domain. On a grid, problems can frequently be solved more efficiently and simpler than in Euclidean space [Ove88a] On the other hand, problems like how to handle the intersection point of two integer based line segments are ....
F.F. Yao. Computational Geometry. Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, Elsevier Science Publishers B.V., 343-389, 1992.
Extending a Library for Geometric Computation to Provide.. - De Lorenzi (1995) (Correct)
....analysis, proved to be a perfect match. Computational geometry has now enjoyed two decades of rapid progress. It turned a field characterized by trial and error into a discipline where no programmer can work competently in ignorance of theory. For an overview on computational geometry, see [Yao 90] A more detailed introduction is given by Preparata and Shamos [Preparata 85] where the computational geometry methodology is presented through detailed case studies. Whereas theoretical insight is rapidly improving, commercially available software and data base technology have yet to take into ....
F. F. Yao: Computational Geometry, Handbook of Theoretical Computer Science, Vol. A, Elsevier Science, 1990, 344--389.
Implementation of the ROSE Algebra: Efficient Algorithms for.. - Güting, al. (Correct)
....computational geometry, as described in this paper, defined on a uniform, discrete grid such that points, end points of line segments, vertices of polygons etc. have integer coordinates instead of arbitrary floating point coordinates, has been emphasized by Greene and Yao [GrY86] as well as Yao [Ya92]. Finite precision geometry has so far only been studied by a few researchers (overviews can be found in [KeK81, Ov88b, Ov88c] Problems considered are, for example, the nearest neighbour searching problem [KaM85] range searching on a grid [Ov88a, Ov88b] the point location problem [M 85] the ....
Yao F.F., Computational Geometry. Algorithms and Complexity. Handbook of Theoretical Computer Science, vol. A, Elsevier Science Publishers B.V., 1992, 343-389.
Analysis of Half-Space Range Search Using the k-d Search Skip.. - Lopez, Nickerson (Correct)
No context found.
F.F. Yao. Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 7, pages 370--374. Elsevier, Amsterdam, 1990.
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