P Rigaux, M Scholl, A Voisard - 2002 - books.google.com
" Spatial Databases covers all of the major themes of the field--representation, query languages, computational geometry, spatial indexing--using geographic information …
The intended audience of this book (and the combined two volumes especially) is quite broad. It can be used in a variety of computer graphics courses or by those who are trying to …
G Greiner, K Hormann - ACM Transactions on Graphics (TOG), 1998 - dl.acm.org
Clipping 2D polygons is one of the basic routines in computer graphics. In rendering complex 3D images it has to be done several thousand times. Efficient algorithms are …
YD Liang, BA Barsky - ACM Transactions on Graphics (TOG), 1984 - dl.acm.org
A new concept and method for line clipping is developed that describes clipping in an exact and mathematical form. The basic ideas form the foundation for a family of algorithms for …
While both structured and unstructured approaches for CFD have enjoyed reasonable success in their application to real-world problems, neither method has offered a truly …
V Skala - Informatica, 2023 - content.iospress.com
This contribution presents a brief survey of clipping and intersection algorithms in E 2 and E 3 with a nearly complete list of relevant references. Some algorithms use the projective …
This paper presents a new algorithm for computing Boolean operations on polygons. These kind of operations are frequently used in the geosciences in order to get spatial information …
This paper presents a new 2D polygon clipping method, based on an extension to the Sutherland-Cohen 2D line clipping method. After discussing three basic polygon clipping …