{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:10:01Z","timestamp":1737418201527,"version":"3.33.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T00:00:00Z","timestamp":1189641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s00454-007-9032-z","type":"journal-article","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T13:59:25Z","timestamp":1189605565000},"page":"701-725","source":"Crossref","is-referenced-by-count":0,"title":["Pre-Triangulations and Liftable Complexes"],"prefix":"10.1007","volume":"38","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,13]]},"reference":[{"key":"9032_CR1","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1137\/S0097539702411368","volume":"32","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H., Brass, P.: Pseudo-triangulations from surfaces and a novel type of edge flip. SIAM J. Comput. 32, 1621\u20131653 (2003)","journal-title":"SIAM J. Comput."},{"key":"9032_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"9032_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02187870","volume":"2","author":"F. Aurenhammer","year":"1987","unstructured":"Aurenhammer, F.: A criterion for the affine equivalence of cell complexes in R d and convex polyhedra in R d+1. Discrete Comput. Geom. 2, 49\u201364 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR4","unstructured":"Aurenhammer, F., Hackl, T., Krasser, H.: Short flip sequences for constructing the Delaunay triangulation. Manuscript (2006)"},{"key":"9032_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00454-005-1208-9","volume":"35","author":"F. Aurenhammer","year":"2006","unstructured":"Aurenhammer, F., Krasser, H.: Pseudo-simplicial complexes from maximal locally convex functions. Discrete Comput. Geom. 35, 201\u2013221 (2006)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR6","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1142\/9789812831699_0003","volume-title":"Computing in Euclidean Geometry","author":"M. Bern","year":"1995","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.-Z., Hwang, F. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol.\u00a04, pp.\u00a047\u2013123. World Scientific, Singapore (1995)"},{"key":"9032_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1148-8","volume-title":"An Introduction to Convex Polytopes","author":"A. Br\u00f8ndsted","year":"1983","unstructured":"Br\u00f8ndsted, A.: An Introduction to Convex Polytopes. Springer, Berlin (1983)"},{"key":"9032_CR8","first-page":"55","volume":"20","author":"H. Crapo","year":"1993","unstructured":"Crapo, H., Whiteley, W.: Plane self stresses and projected polyhedra. Struct. Topol. 20, 55\u201378 (1993)","journal-title":"Struct. Topol."},{"key":"9032_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)"},{"key":"9032_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01975867","volume":"15","author":"H. Edelsbrunner","year":"1996","unstructured":"Edelsbrunner, H., Shah, N.R.: Incremental topological flipping works for regular triangulations. Algorithmica 15, 223\u2013241 (1996)","journal-title":"Algorithmica"},{"key":"9032_CR11","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1142\/9789812831699_0007","volume-title":"Computing in Euclidean Geometry","author":"S. Fortune","year":"1995","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Du, D.-Z., Hwang, F. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol.\u00a04, pp.\u00a0225\u2013265. World Scientific, Singapore (1995)"},{"key":"9032_CR12","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J.E. Goodman","year":"1983","unstructured":"Goodman, J.E., Pollack, R.: Multidimensional sorting. SIAM J. Comput. 12, 484\u2013507 (1983)","journal-title":"SIAM J. Comput."},{"key":"9032_CR13","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Wiley\u2013Interscience, London (1967)"},{"key":"9032_CR14","unstructured":"Hackl, T.: Manipulation of pseudo-triangular surfaces. Master thesis, Institute for Theoretical Computer Science, University of Technology, Graz, Austria (2004)"},{"key":"9032_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F. Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete Comput. Geom. 22, 333\u2013346 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-8396(86)90001-4","volume":"3","author":"C.L. Lawson","year":"1986","unstructured":"Lawson, C.L.: Properties of n-dimensional triangulations. Comput. Aided Geom. Des. 3, 231\u2013246 (1986)","journal-title":"Comput. Aided Geom. Des."},{"key":"9032_CR17","first-page":"383","volume-title":"Handbook of Discrete and Computational Geometry","author":"C.W. Lee","year":"2004","unstructured":"Lee, C.W.: Subdivisions and triangulations of polytopes. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 383\u2013406. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"9032_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom.\u00a01, 201\u2013217 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00454-004-1143-1","volume":"33","author":"D. Orden","year":"2005","unstructured":"Orden, D., Santos, F.: The polytope of non-crossing graphs on a planar point set. Discrete Comput. Geom. 33, 275\u2013305 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR20","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M. Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom. 16, 419\u2013453 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"9032_CR21","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, New York (1985)"},{"key":"9032_CR22","unstructured":"Rote, G., Schulz, A.: A pointed Delaunay pseudo-triangulation of a simple polygon. In: Proceedings of the 21st European Workshop on Computational Geometry, pp.\u00a077\u201380 (2005)"},{"key":"9032_CR23","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Enzyklopaedie der Math. Wiss. III AB 12, Leipzig (1916)"},{"key":"9032_CR24","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proceedings of the 41st IEEE Symposium on FOCS, pp.\u00a0443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9032-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-007-9032-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9032-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T23:36:29Z","timestamp":1737416189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-007-9032-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,13]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9032"],"URL":"https:\/\/doi.org\/10.1007\/s00454-007-9032-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2007,9,13]]}}}