1,635
Views
14
CrossRef citations to date
0
Altmetric
Original Articles

SPLITAREA: an algorithm for weighted splitting of faces in the context of a planar partition

, &
Pages 1522-1551 | Received 09 Oct 2014, Accepted 20 Dec 2015, Published online: 18 Feb 2016

References

  • Ai, T. and Van Oosterom, P., 2002. Gap-tree extensions based on skeletons. In: D. Richardson and P. Van Oosterom, eds. Advances in spatial data handling, 10th international symposium on spatial data handling. Berlin: Springer-Verlag, 501–513. doi:10.1007/978-3-642-56094-1
  • Attali, D., Baja, G., and Thiel, E., 1995, Pruning discrete and semicontinuous skeletons. In: C. Braccini, L. DeFloriani, and G. Vernazza, eds. Image Analysis and Processing, Springer Berlin/Heidelberg, Lecture Notes in Computer Science. Vol. 974. Berlin: Springer, 488–493.
  • Bader, M. and Weibel, R., 1997. Detecting and resolving size and proximity conflicts in the generalization of polygonal maps [online]. In: L. Ottoson, ed. Proceedings of the 18th international cartographic conference, 23–27 June Stockholm, 1525–1532. Available from: http://icaci.org/files/documents/ICC_proceedings/ICC1997/icc1997_volume3_part2.pdf
  • Bai, X. and Latecki, L.J., 2007, Discrete skeleton evolution. In: A.L. Yuille, et al., eds. Energy minimization methods in computer vision and pattern recognition, Lecture Notes in Computer Science. Vol. 4679. Berlin: Springer, 362–374.
  • Baumgart, B.G., 1975. A polyhedron representation for computer vision. In: AFIPS ’75: proceedings of the may 19-22, 1975, national computer conference and exposition. New York, NY: ACM, 589–596. doi:10.1145/1499949.1500071
  • Beard, K.M. and Chrisman, N.R., 1988, Zipper: a localized approach to edgematching. Cartography and Geographic Information Science, 15 (2), 163–172. doi:10.1559/152304088783887071
  • Biedl, T., et al., 2015, Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications, 48 (2), 120–133. doi:10.1016/j.comgeo.2014.08.006
  • Blum, H., 1967, A transformation for extracting new descriptors of shape. Models for the Perception of Speech and Visual Form, 19 (5), 362–380.
  • Brassel, K.E. and Weibel, R., 1988, A review and conceptual framework of automated map generalization. International Journal of Geographical Information Systems, 2 (3), 229–244. doi:10.1080/02693798808927898
  • Chrisman, N.R., 1990, Deficiencies of sheets and tiles: building sheetless databases. International Journal of Geographical Information Systems, 4 (2), 157–167. doi:10.1080/02693799008941537
  • Dougenik, J.A., Chrisman, N.R., and Niemeyer, D.R., 1985, An algorithm to construct continuous area cartograms. The Professional Geographer, 37 (1), 75–81. doi:10.1111/j.0033-0124.1985.00075.x
  • Gold, C. and Snoeyink, J., 2001, A one-step crust and skeleton extraction algorithm. Algorithmica, 30 (2), 144–163. doi:10.1007/s00453-001-0014-x
  • Haunert, J.-H. and Sester, M., 2008, Area collapse and road centerlines based on straight skeletons. GeoInformatica, 12 (2), 169–191. doi:10.1007/s10707-007-0028-x
  • Haunert, J.-H. and Wolff, A., 2010, Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science, 24 (12), 1871–1897. doi:10.1080/13658810903401008
  • Hofman, A., 2008. Developing a vario-scale IMGeo using the constrained tGAP structure. Thesis (Master’s). TU Delft.
  • Hofman, A., et al., 2008. Using the constrained tgap for generalisation of imgeo to top10nl model [online]. In: W. Mackaness and S. Mustière, eds. Proceedings of the ICA commission on map generalisation and multiple representation. ICA Commission on Generalisation and Multiple Representation, 1–23. Available from: http://generalisation.icaci.org/images/files/workshop/workshop2008/27_Hofman_et_al.pdf
  • Jones, C.B., Bundy, G.L., and Ware, M.J., 1995, Map generalization with a triangulated data structure. Cartography and Geographic Information Science, 22 (4), 317–331.
  • Kelly, T., 2013. Unwritten procedural modeling with the straight skeleton. Thesis (PhD). University of Glasgow.
  • Kieler, B., et al., 2009. Matching river datasets of different scales. In: M. Sester, L. Bernard, and V. Paelke, eds. Advances in GISCIENCE, lecture notes in geoinformation and cartography. Berlin: Springer, 135–154.
  • Kulik, L., Duckham, M., and Egenhofer, M., 2005, Ontology-driven map generalization. Journal of Visual Languages & Computing, 16 (3), 245–267. doi:10.1016/j.jvlc.2005.02.001
  • Ledoux, H. and Arroyo Ohori, K., 2011. Edge-matching polygons with a constrained triangulation [online]. In: Proceedings of symposium GIS Ostrava 2011, 24–26 January Ostrava. Available from: https://3d.bk.tudelft.nl/hledoux/pdfs/11_ostrava.pdf
  • Liu, Y. and Snoeyink, J., 2008, Faraway point: a sentinel point for delaunay computation. International Journal of Computational Geometry & Applications, 18 (4), 343–355. doi:10.1142/S0218195908002660
  • McAllister, M. and Snoeyink, J., 2000. Medial axis generalization of river networks. Cartography and Geographic Information Science, 27, 129–138. doi:10.1559/152304000783547966
  • McMaster, R.B. and Shea, K.S., 1992. Generalization in digital cartography. Washington, DC: Association of American Geographers.
  • Meijers, M., Van Oosterom, P., and Quak, W., 2009. A storage and transfer efficient data structure for variable scale vector data. In: M. Sester, L. Bernard, and V. Paelke, eds. Advances in GIScience, Springer Berlin Heidelberg, lecture notes in geoinformation and cartography. Berlin: Springer, 345–367.
  • Ohori, K.A., Ledoux, H., and Meijers, M., 2012, Validation and automatic repair of planar partitions using a constrained triangulation. Photogrammetrie - Fernerkundung - Geoinformation, 2012 (5), 613–630. doi:10.1127/1432-8364/2012/0143
  • Regnauld, N. and Mackaness, W.A., 2006, Creating a hydrographic network from its cartographic representation: a case study using Ordnance survey MasterMap data. International Journal of Geographical Information Science, 20 (6), 611–631. doi:10.1080/13658810600607402
  • Schwering, A., 2008, Approaches to semantic similarity measurement for geo-spatial data: a survey. Transactions in GIS, 12 (1), 5–29. doi:10.1111/tgis.2008.12.issue-1
  • Shewchuk, J.R., 2008, General-dimensional constrained Delaunay and constrained regular triangulations, I: combinatorial properties. Discrete & Computational Geometry, 39 (1–3), 580–637. doi:10.1007/s00454-008-9060-3
  • Shewchuk, J.R. and Brown, B.C., 2015, Fast segment insertion and incremental construction of constrained Delaunay triangulations. Computational Geometry, 48 (8), 554–574. doi:10.1016/j.comgeo.2015.04.006
  • Smogavec, G. and Žalik, B., 2012, A fast algorithm for constructing approximate medial axis of polygons, using Steiner points. Advances in Engineering Software, 52 (1), 1–9. doi:10.1016/j.advengsoft.2012.05.006
  • Stoter, J., et al., 2013, Fully automated generalization of a 1:50k map from 1:10k data. Cartography and Geographic Information Science, 0 (0), 1–13.
  • Szombara, S., 2013. Unambiguous collapse operator of digital cartographic generalisation process [online]. In: D. Burghardt, ed. Proceedings of the 16th ICA generalisation workshop. ICA Commission on Generalisation and Multiple Representation, 1–10. Available from: http://generalisation.icaci.org/images/files/workshop/workshop2013/genemappro2013_submission_20.pdf
  • Uitermark, H., Vogels, A., and Van Oosterom, P., 1999. Semantic and geometric aspects of integrating road networks. In: A. Včkovski, K.E. Brassel, and H.-J. Schek, eds. INTEROP ’99: proceedings of the second international conference on interoperating geographic information systems. Vol. 1580. London: Springer-Verlag, 177–188.
  • van Oosterom, P., 1993. The GAP-tree, an approach to “On-the-Fly”' map generalization of an area partitioning [online]. In: J.-C. Mueller, J.P. Lagrange, and R. Weibel, eds. GIS and generalization, methodology and practice, GISDATA specialist meeting on generalization, 15–19 December Compienge. London: Taylor & Francis, 120–132, 1995. Available from: https://www.crcpress.com/GIS-And-Generalisation-Methodology-And-Practice/Lagrange-Weibel-Muller/9780748403196
  • Van Oosterom, P., 2005. Variable-scale topological data structures suitable for progressive data transfer: the GAP-face tree and GAP-edge forest. Cartography and Geographic Information Science, 32, 331–346. doi:10.1559/152304005775194782
  • Van Putten, J. and Van Oosterom, P., 1998. New results with generalized area partitionings. In: T.K. Poiker and N. Chrisman, eds. Proceedings: 8th international symposium on spatial data handling. Burnaby, BC: International Geographical Union, Geographic Information Science Study Group, 485–495.
  • Van Smaalen, J., 2003. Automated aggregation of geographic objects: a new approach to the conceptual generalisation of geographic databases. Thesis (PhD). Wageningen University.
  • Vermeij, M., et al., 2003. Storing and using scale-less topological data efficiently in a client-server DBMS environment. In: Proceedings of the 7th International Conference on GeoComputation [online], 8–10 September University of Southampton, Southampton. GeoComputation CD-ROM. Available from: http://www.geocomputation.org/2003/Papers/Vermeij_Paper.pdf.
  • Worboys, M.F. and Duckham, M., 2004. GIS: a computing perspective [online]. 2nd ed. Boca Raton, FL: CRC Press. Available from: https://www.crcpress.com/GIS-A-Computing-Perspective-Second-Edition/Worboys-Duckham/9780415283755
  • Yang, J., et al., 2013, Land use patch generalization based on semantic priority. Abstract and Applied Analysis, 2013, 1–8.
  • Yaolin, L., et al., 2003, Categorical database generalization. Geospatial Information Science, 6 (4), 1–9. doi:10.1007/BF02826943