AtmoGIS - integration of atmospheric models and GIS. Lars Bernard, Benno Schmidt, and Ulrich Streit. Multidimensional binary search trees used for associative searching. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, number 322–330, 1990. The R*-tree: An efficient and robust access method for points and rectangles. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. In AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition, pages 589–596. A polyhedron representation for computer vision. In Geoffrey Dutton, editor, Harvard Papers on Geographic Information Systems, volume 4. The efficient hierarchical data structure for the US historical boundary file. Filling gaps in the boundary of a polyhedron. ACM Transactions on Mathematical Software, 22(4):469–483, December 1996. The Quickhull algorithm for convex hulls. In Computer Graphics, Imaging and Visualisation.
Point based rendering of implicit 4-dimensional surfaces. Strip trees: A hierarchical representation for curves. Technical report, Purdue University, 1990.ĭana H. Convex decomposition of polyhedra and robustness. In IEEE Symposium on Volume Visualization. Hypervolume visualization: A challenge in simplicity. In Proceedings of the 7th ACM International Symposium on Advances in Geographic Information Systems, pages 97–102. On local heuristics to speed up polygon-polygon intersection tests. Why you shouldn't use set (and what you should use instead). Polygon mesh repairing: An application perspectice. Marco Attene, Marcel Campen, and Leif Kobbelt. On converting sets of tetrahedra to combinatorial and PL manifolds. Marco Attene, Daniela Giorgi, Massimo Ferri, and Bianca Falcidieno. Springer Berlin Heidelberg, Ho Chi Minh City, Vietnam, June 2013.Įmil Artin. 13th International Conference, Ho Chi Minh City, Vietnam, June 24–27, 2013, Proceedings, Part I, volume 7971 of Lecture Notes in Computer Science, pages 526–539. Gervasi, editors, Computational Science and Its Applications - ICCSA 2013. Modelling higher dimensional data for GIS using generalised maps. Ken Arroyo Ohori, Hugo Ledoux, and Jantien Stoter. Master's thesis, Delft University of Technology, August 2010. Validation and automatic repair of planar partitions using a constrained triangulation. American Society for Photogrammetry and Remote Sensing, 1988. In GIS/LIS '88 : proceedings : accessing the world : third annual International Conference, Exhibits, and Workshops, pages 880–889. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. ACM, 1998.Īlexandr Andoni and Piotr Indyk. In SCG '98 Proceedings of the 14th annual symposium on Computational geometry, pages 39–48. Surface reconstruction by Voronoi filtering. In Proceedings of the 14th International Meshing Roundtable, pages 485–504, 2005. Compact array-based mesh data structures. Proceedings of the National Academy of Sciences of the United States of America, 10(1):8–10, 1924.
An example of a simply connected surface bounding a region which is not simply connected. Proceedings of the ISPRS 8th 3DGeoInfo Conference & WG II/2 Workshop, pages 1–6, Istanbul, Turkey, 2013. In Umit Isikdag, editor, ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences. Towards automatic validation and healing of CityGML models for geometric and semantic consistency. International Journal of Geographical Information Systems, 8(1):95–103, 1994. Bibliography on spatiotemporal databases. Conceptions of space and time: sources, evolution, directions. UNION Agency - Science Press, February 2003. Classifying edges and faces as manifold or non-manifold elements in 4D orthogonal pseudo-polytopes. Ricardo Pérez Aguila and Antonio Aguilera Ramírez.
Journal of Spatial Information Science, 4:85–123, 2012. Spatial models for indoor & context-aware navigation systems: A survey. Imad Afyouni, Cyril Ray, and Christophe Claramunt.
0 kommentar(er)
