Nagy, G., M. Mukherjee and D. Embly, 1990. Making do with finite numerical precision in spatial data structures. Proc. 4 International Symposium on Spatial Data Handling, pp. 55-65.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....stated in [GrY86] through the finite representation . disjoint points and lines may collapse. However, aside from such degeneracies, we do guarantee that topology does not change. There has been a lot of work on numeric robustness and topological correctness for geometric computation (e.g. [OtTU87, GuiSS89, EdM88, NaME90]) We have selected [GrY86] because it fits well with our idea of realms as grid based planar graphs underlying spatial data types. However, one might try to extend this by adding further integrity constraints (such as our rule that R points must not lie on envelopes) or by techniques from the ....

Nagy, G., M. Mukherjee, and D.W. Embley, Making Do with Finite Numerical Precision in Spatial Data Structures. Proc. 4th Intl. Symp. on Spatial Data Handling (Zrich, Switzerland), 1990, 55-65.

....has many practical uses. We illustrate the usefulness of the combined diagram with various cartographic applications. 1 Introduction and Previous Work Workers in both Computational Geometry and Geomatics have discussed appropriate data structures for managing two dimensional maps, for example [B86, F87, CDW92, H89, NME90, PC75, W95]. However, it is rarely noted that data input is the largest expense in Geographic Information Systems, and that the spatial data structure has a large influence on the cost of topological data input and structuring. See [G94a, G94b, GRR97] for a discussion of traditional spaghetti digitizing, and ....

Nagy, G., M. Mukherjee and D. Embly, 1990. Making do with finite numerical precision in spatial data structures. Proc. 4 th International Symposium on Spatial Data Handling, pp. 55-65.

....and robust numerical results must be obtained. Provided that the input data are exact, the task is to determine how many digits of precision are required by numerical computations so that the algorithm produces correct results and takes into account desired accuracy. Perturbation approaches (e.g. [DS90, EM88, GM95, GSS89, GY86, HHK88, Mil89, NME90, Sch94]) allow to slightly change input data or computed results. Because in many applications the input data are approximate from the beginning, such slight alterations seem to be tolerable. This paper is based on an interesting subclass of perturbation approaches that attempt to transform geometric ....

G. Nagy, M. Mukherjee & D.W. Embley. Making Do with Finite Numerical Precision in Spatial Data Structures. 4th Int. Symp. on Spatial Data Handling, 55-65, 1990.

....We show that this is equivalent to the original algorithm, and illustrate its utility with various cartographic applications. 1 Introduction Workers in both Computational Geometry and Geomatics have discussed appropriate data structures for managing two dimensional maps, for example [B86, F87, CDW92, H89, NME90, PC75, W95]. However, it is rarely noted that data input is the largest expense in Geographic Information Systems, and that the spatial data structure has a large influence on the cost of topological data input and structuring. See [G94a, G94b, GRR97] for a discussion of traditional spaghetti digitizing, and ....

Nagy, G., M. Mukherjee and D. Embly, 1990. Making do with finite numerical precision in spatial data structures. Proc. 4 th International Symposium on Spatial Data Handling, pp. 55-65.

No context found.

Nagy, G., M. Mukherjee and D. Embly, 1990. Making do with finite numerical precision in spatial data structures. Proc. 4 International Symposium on Spatial Data Handling, pp. 55-65.

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