{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:32:26Z","timestamp":1740547946867,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220565"},{"type":"electronic","value":"9783540247098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24709-8_58","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:43:48Z","timestamp":1284169428000},"page":"544-553","source":"Crossref","is-referenced-by-count":1,"title":["On Triangulations"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Hainz, R.: New results on MWT subgraphs, TR Nr. 140, Institute for Theoretical Computer Science, Graz University of Technology (1998)"},{"issue":"4","key":"58_CR2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/PL00009475","volume":"22","author":"N. Amenta","year":"199","unstructured":"Amenta, N., Bern, M.: Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry\u00a022(4), 481\u2013504 (199)","journal-title":"Discrete and Computational Geometry"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0097-8493(96)00085-4","volume":"21","author":"M.V. Anglada","year":"1997","unstructured":"Anglada, M.V.: An Improved incremental algorithm for constructing restricted Delaunay triangulations. Computers & Graphics\u00a021, 215\u2013223 (1997)","journal-title":"Computers & Graphics"},{"issue":"3","key":"58_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput Surv.\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Comput Surv."},{"key":"58_CR5","unstructured":"Bart\u00e1nus, M., Ferko, A., Mag, R., Niepel, L., Plachetka, T., \u0160ikudov\u00e1, E.: New heuristics for minimum weight triangulation. In: WSCG 1996, Conference Proceedings, University of West Bohemia, Pilsen, pp. 31\u201340 (1996)"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Beirouti, R., Snoeyink, J.: Implementations of the LMT heuristic for minimum weight triangulation. In: Proc. 14th Annual Symp Comput Geom, Minneapolis, pp. 96\u2013105 (1998)","DOI":"10.1145\/276884.276895"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02573962","volume":"10","author":"M. Bern","year":"1993","unstructured":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., Tan, T.S.: Edge insertion for optimal triangulations. Discrete Comput. Geom.\u00a010, 47\u201365 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"58_CR8","series-title":"Lecture Notes Series on Computing","first-page":"47","volume-title":"Mesh generation and optimal triangulation","author":"M. Bern","year":"1994","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation, 2nd edn. Lecture Notes Series on Computing, vol.\u00a04, pp. 47\u2013123. World Scientific, Singapore (1994)","edition":"2"},{"key":"58_CR9","series-title":"Algorithms and applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational geometry","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry. Algorithms and applications. Springer, Heidelberg (1997)"},{"issue":"5","key":"58_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","volume":"9","author":"K.Q. Brown","year":"1979","unstructured":"Brown, K.Q.: Voronoi diagrams from convex hulls. Inf. Proc. Letters\u00a09(5), 223\u2013228 (1979)","journal-title":"Inf. Proc. Letters"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Cignoni, P., Montani, C., Perego, R., Scopigno, R.: Parallel 3D Delaunay triangulation. In: Proc. of Eurographics, pp. C129\u2013C142 (1993)","DOI":"10.1111\/1467-8659.1230129"},{"key":"58_CR12","doi-asserted-by":"crossref","unstructured":"Dickerson, M.T., Drysdale, R.L.S., McElfresh, S.A., Welzl, E.: Fast greedy triangulation algorithms. In: Proc.10th Annual Symp. on Comp., pp. 211\u2013220 (1994)","DOI":"10.1145\/177424.177649"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"Dickerson, M.T., Montague, M.H.: A (usually?) connected subgraph of the minimum weight triangulation. In: Proc. 12th Sym. Comput. Geom., Philadelphia, pp. 204\u2013213 (1996)","DOI":"10.1145\/237218.237364"},{"key":"58_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1093\/imanum\/10.1.137","volume":"10","author":"N. Dyn","year":"1990","unstructured":"Dyn, N., Levin, D., Rippa, S.: Data dependent triangulations for piecewise linear interpolation. IMA. J. Numer. Anal.\u00a010, 137\u2013154 (1990)","journal-title":"IMA. J. Numer. Anal."},{"key":"58_CR15","doi-asserted-by":"crossref","unstructured":"Dwyer, R.A.: A Simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(n log log n) expected time. In: Proc. of the 2nd Annual Symposium on Comp. Geom., pp. 276\u2013284 (1986)","DOI":"10.1145\/10515.10545"},{"key":"58_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/0222036","volume":"22","author":"H. Edelsbrunner","year":"1991","unstructured":"Edelsbrunner, H., Tan, T.S.: A quadratic time algorithm for the minmax length triangulation. SIAM J. Comput.\u00a022, 527\u2013551 (1991)","journal-title":"SIAM J. Comput."},{"key":"58_CR17","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0913058","volume":"13","author":"H. Edelsbrunner","year":"1992","unstructured":"Edelsbrunner, H., Tan, T.S., Waupotisch, R.: An O(N2 log N) time algorithm for the minmax angle triangulation. SIAM J. Stat. Sci. Compu.\u00a013, 994\u20131008 (1992)","journal-title":"SIAM J. Stat. Sci. Compu."},{"key":"58_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(92)90013-I","volume":"1","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D.: The farthest point Delaunay triangulation minimizes angles. Comput. Geom. Theory Appl.\u00a01, 143\u2013148 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"58_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S.J. Fortune","year":"1987","unstructured":"Fortune, S.J.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"58_CR20","unstructured":"Georgia Institute of Technology. Large geometric models archive, Available at http:\/\/www.cc.gatech.edu\/projects\/large_models"},{"key":"58_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0923-5965(89)90007-6","volume":"1","author":"M. Gilge","year":"1989","unstructured":"Gilge, M., Engelhardt, T., Mehlan, R.: R Coding of arbitrary shaped image segments based on a generalized orthogonal transform. Signal Processing: Image Communication\u00a0(1), 153\u2013180 (1989)","journal-title":"Signal Processing: Image Communication"},{"volume-title":"Handbook of Discrete and Computational Geometry","year":"1997","key":"58_CR22","unstructured":"Goodmann, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)"},{"key":"58_CR23","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica\u00a07, 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"58_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","volume":"8","author":"B. Joe","year":"1991","unstructured":"Joe, B.: Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design\u00a08, 123\u2013142 (1991)","journal-title":"Computer Aided Geometric Design"},{"issue":"7","key":"58_CR25","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/83.701143","volume":"7","author":"A. Kaup","year":"1998","unstructured":"Kaup, A., Aach, T.: Coding of segmented images using shape-independent basis functions. IEEE Transactions on Image Processing\u00a07(7), 937\u2013947 (1998)","journal-title":"IEEE Transactions on Image Processing"},{"key":"58_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00371-002-0173-z","volume":"18","author":"I. Kolingerov\u00e1","year":"2002","unstructured":"Kolingerov\u00e1, I., Kohout, J.: Optimistic parallel Delaunay triangulation. The Visual Computer\u00a018, 511\u2013529 (2002)","journal-title":"The Visual Computer"},{"key":"58_CR27","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/s003710100125","volume":"17","author":"I. Kolingerov\u00e1","year":"2001","unstructured":"Kolingerov\u00e1, I., Ferko, A.: Multicriteria-optimized triangulations. The Visual Computer\u00a017, 380\u2013395 (2001)","journal-title":"The Visual Computer"},{"key":"58_CR28","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0097-8493(02)00090-0","volume":"26","author":"I. Kolingerov\u00e1","year":"2002","unstructured":"Kolingerov\u00e1, I., \u017dalik, B.: Improvements to randomized incremental Delaunay insertion. Computers & Graphics\u00a026, 477\u2013490 (2002)","journal-title":"Computers & Graphics"},{"key":"58_CR29","doi-asserted-by":"crossref","unstructured":"Kolingerov\u00e1, I., Strych, V., ada, V.: Using constraints in Delaunay and greedy triangulation for contour lines improvement. Accepted for publication on ICCS conference, Krakow, Poland (2004)","DOI":"10.1007\/978-3-540-25944-2_16"},{"key":"58_CR30","unstructured":"Krznaric, D.: Progress in hierarchical clustering & minimum weight triangulation, PhD Thesis, University of Lund, Sweden (1997)"},{"key":"58_CR31","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01994882","volume":"32","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: Fast algorithms for greedy triangulation. BIT\u00a032, 280\u2013296 (1992)","journal-title":"BIT"},{"key":"58_CR32","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/B978-0-12-587260-7.50011-X","volume-title":"Mathematical Software III","author":"C.L. Lawson","year":"1977","unstructured":"Lawson, C.L.: Software for C1 interpolation. In: Rice, J.R. (ed.) Mathematical Software III, pp. 161\u2013194. Academic Press, New York (1977)"},{"key":"58_CR33","unstructured":"Magov\u00e1, I., Ferko, A., Niepel, L.: On edges elimination for the shortest mesh. In: WSCG 1997 Conference Proceedings, University of West Bohemia, Pilsen, pp. 396\u2013403 (1997)"},{"key":"58_CR34","doi-asserted-by":"crossref","unstructured":"Maur, P., Kolingerov\u00e1, I.: Post-optimization of Delaunay tetrahedrization. In: SCCG IEEE Proceedings, Los Alamitos, USA, pp. 31\u201338 (2001) ISBN 0-7695-1215-1","DOI":"10.1109\/SCCG.2001.945334"},{"key":"58_CR35","unstructured":"Midtbo, T.: Spatial modelling by Delaunay networks of two and three dimensions (1993), http:\/\/www.iko.unit.no\/tmp\/term.html"},{"key":"58_CR36","volume-title":"Spatial tesselations: concepts and applications of Voronoi diagrams","author":"A. Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial tesselations: concepts and applications of Voronoi diagrams. John Wiley & Sons, Chichester (1992)"},{"key":"58_CR37","volume-title":"Computational geometry in C","author":"J. O\u2019 Rourke","year":"1994","unstructured":"O\u2019 Rourke, J.: Computational geometry in C. Cambridge University Press, New York (1994)"},{"key":"58_CR38","unstructured":"Partyk, M., Polec, J., Kolingerov\u00e1, I., Bezina, A.: Triangulations in a hybrid scheme for shape independent transform coding. In: Proc. ACIVS, Ghent, Belgium, pp. 137\u2013141 (2003)"},{"key":"58_CR39","unstructured":"Polec, J., et al.: New scheme for region approximation and coding with shape independent transform, ISPRS Commision III. In: Proc. Of Symposium Photogrammetric Computer Vision, Graz, Austria, pp. B214\u2013217 (2002)"},{"key":"58_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer, Heidelberg (1985)"},{"key":"58_CR41","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0045-7949(93)90239-A","volume":"47","author":"S.W. Sloan","year":"1993","unstructured":"Sloan, S.W.: A fast algorithm for generating constrained Delaunay triangulations. Computers & Structures\u00a047, 441\u2013450 (1993)","journal-title":"Computers & Structures"},{"key":"58_CR42","unstructured":"Stanford Computer Graphics Laboratory. The Stanford data scanning repository, Available at http:\/\/graphics.stanford.edu.data\/3Dscanrep\/"},{"key":"58_CR43","first-page":"61","volume-title":"Proc. 11th Annual Symp. on Comp.","author":"P. Su","year":"1995","unstructured":"Su, P., Drysdale, R.L.S.: A comparison of sequential Delaunay triangulation algorithms. In: Proc. 11th Annual Symp. on Comp., pp. 61\u201370. ACM, New York (1995)"},{"key":"58_CR44","doi-asserted-by":"crossref","unstructured":"Varnu\u0161ka, M., Kolingerov\u00e1, I.: Boundary filtering in surface reconstruction. Accepted for publication in ICCA conference, Assissi, Italy (2004)","DOI":"10.1007\/978-3-540-24709-8_72"},{"key":"58_CR45","doi-asserted-by":"crossref","unstructured":"Varnu\u0161ka, M., Kolingerov\u00e1, M.I.: Manifold extraction for surface reconstruction. Accepted for publication in ICCS conference, Krakow, Poland (2004)","DOI":"10.1007\/978-3-540-25944-2_19"},{"issue":"2","key":"58_CR46","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","volume":"24","author":"D.F. Watson","year":"1981","unstructured":"Watson, D.F.: Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Comput. J.\u00a024(2), 167\u2013172 (1981)","journal-title":"Comput. J."},{"key":"58_CR47","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1080\/713811749","volume":"17","author":"B. \u017dalik","year":"2003","unstructured":"\u017dalik, B., Kolingerov\u00e1, I.: An Incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm. Int. J. Geographical Information Science\u00a017, 119\u2013138 (2003)","journal-title":"Int. J. Geographical Information Science"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24709-8_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:09:16Z","timestamp":1740506956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24709-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220565","9783540247098"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24709-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}