6 citations found. Retrieving documents...
D. Peuquet and D. Marble. Technical description of the dime system. In Introductory Readings in Geographic Information Systems, pages 100--111. Taylor & Francis, 1990.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
An Improved Algorithm for Subdivision Traversal without Extra.. - Bose, Morin (1999)   (4 citations)  (Correct)

.... This functionality is available in or can be simulated by the most commonly used data structures for storing planar subdivisions including the doublyconnected edge list [11, 14] the quad edge structure [8] the fully topological network structure [1] the ARC INFO structure [12] and the DIME le [13]. Our algorithm also requires the use of some geometric operations. Let dist(a; b) be the distance between two points a and b. Let ab be the direction of the ray originating at a and containing b. The angle formed by three points a, b and c is denoted by 6 abc and always refers to the ....

D. J. Peuquet and D. F. Marble. Technical description of the DIME system. In Introductory Readings in Geographic Information Systems, pages 100-111. Taylor & Francis, 1990.


An Improved Algorithm for Subdivision Traversal without Extra.. - Bose, Morin (1999)   (4 citations)  (Correct)

.... functionality is available in or can be simulated by the most commonly used data structures for storing planar subdivisions including the doubly connected edge list [10, 13] the quad edge structure [8] the fully topological network structure [1] the ARC INFO structure [11] and the DIME le [12]. Our algorithm also requires the use of some geometric operations. Let dist(a; b) be the distance between two points a and b. Let ab be the direction of the ray originating at a and containing b. The angle formed by three points a, b and c is denoted by 6 abc and always refers to the ....

D. J. Peuquet and D. F. Marble. Technical description of the DIME system. In Introductory Readings in Geographic Information Systems, pages 100-111. Taylor & Francis, 1990.


Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Kreveld.. (1996)   (11 citations)  (Correct)

....topological data structure, windowing, three dimensions. 1 Introduction The basic spatial vector data structure in any geographic information system is the one that stores the zero , one and two dimensional features of planar subdivisions. Contemporary GISs like ARC INFO [15] and the DIME file [16] use polygon structures that store the explicit topology as well. This means that from any feature, it is possible to access adjacent features efficiently. Essentially, these structures are similar to the doubly connected edge list and quad edge structures used in computational geometry. This ....

....data structure used in computational geometry that stores topology explicitly. This is not a restriction; simple adaptations to the algorithms can be done so that they apply to the quad edge structure [13] the fully topological network structure [3] the ARC INFO structure [15] the DIME file [16], or any other vector data structure that stores the topology explicitly. In the next section we give a brief description of the doubly connected edge list structure. Then we proceed with the simple traversal algorithm for subdivisions embedded in the Euclidean plane E 2 and prove its ....

D.J. Peuquet and D.F. Marble (Eds.). Technical description of the DIME system. In Introductory Readings in Geographic Information Systems, pages 100--111. Taylor & Francis, 1990.


Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Oostrum.. (1997)   (11 citations)  (Correct)

....topological data structures, windowing, three dimensions. 1 Introduction The basic spatial vector data structure in any geographic information system is the one that stores the zero , oneand two dimensional features of planar subdivisions. Contemporary GISs like ARC INFO [8] and the DIME file [9] use polygon structures that store the explicit topology as well. This means that from any feature, it is possible to access adjacent features efficiently. Essentially, these structures are similar to the doubly connected edge list and quad edge structures used in computational geometry. A basic ....

D.J. Peuquet and D.F. Marble (Eds.). Technical description of the DIME system. In Introductory Readings in Geographic Information Systems, pages 100--111. Taylor & Francis, 1990.


Traversal of a Quasi-Planar Subdivision without.. - Chavez, Dobrev.. (2004)   (Correct)

No context found.

D. Peuquet and D. Marble. Technical description of the dime system. In Introductory Readings in Geographic Information Systems, pages 100--111. Taylor & Francis, 1990.


Route Discovery with Constant Memory in Oriented.. - Chavez, Dobrev.. (2004)   (Correct)

No context found.

D. Peuquet and D. Marble. Technical description of the dime system. In Introductory Readings in Geographic Information Systems, pages 100--111. Taylor & Francis, 1990. 12

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