{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:42Z","timestamp":1763467482924},"reference-count":36,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0925-7721(97)00019-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:57:07Z","timestamp":1051113427000},"page":"257-276","source":"Crossref","is-referenced-by-count":25,"title":["Converting triangulations to quadrangulations"],"prefix":"10.1016","volume":"9","author":[{"given":"Suneeta","family":"Ramaswami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00019-9_BIB1","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB2","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1002\/nme.1620260314","article-title":"A quadrilateral finite element including vertex rotations for plane elasticity analysis","volume":"26","author":"Allman","year":"1988","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"10.1016\/S0925-7721(97)00019-9_BIB3","series-title":"Algorithms \u2014 ESA '94","first-page":"36","article-title":"Hamiltonian triangulations for fast rendering","volume":"855","author":"Arkin","year":"1994"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB5","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB6","series-title":"Computing in Euclidean Geometry","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(92)90022-N","article-title":"Drawing the planar dual","volume":"43","author":"Bern","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(97)00019-9_BIB8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB9","series-title":"Proc. of the 12th European Workshop on Computational Geometry","article-title":"Experimental comparison of quadrangulation algorithms for sets of points","author":"Bose","year":"1996"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB10","series-title":"Proc. of the International Symposium on Algorithms and Computation","article-title":"No quadrangulation is extremely odd","author":"Bose","year":"1995"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB11","series-title":"Injection Moulding of Plastic Components","author":"Bown","year":"1979"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB12","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00019-9_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","article-title":"A combinatorial theorem in plane geometry","volume":"18","author":"Chvatal","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB14","series-title":"Projective Geometry","author":"Coxeter","year":"1987"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0734-189X(85)90005-2","article-title":"Delaunay-based representation of surfaces defined over arbitrarily shaped domains","volume":"32","author":"De Floriani","year":"1985","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0734-189X(84)80041-9","article-title":"Stationing guards in rectilinear art galleries","volume":"27","author":"Edelsbrunner","year":"1984","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB17","series-title":"Proc. of the 4th Canadian Conference on Computational Geometry","first-page":"77","article-title":"Strictly convex quadrilateralizations of polygons","author":"Everett","year":"1992"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB18","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","article-title":"A short proof of Chvatal's watchman theorem","volume":"24","author":"Fisk","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"issue":"6","key":"10.1016\/S0925-7721(97)00019-9_BIB19","doi-asserted-by":"crossref","first-page":"2535","DOI":"10.1109\/TMAG.1983.1062810","article-title":"A mesh generator for automatically subdividing irregular polygons into quadrilaterals","volume":"19","author":"Heighway","year":"1983","journal-title":"IEEE Trans. Magnetics"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0010-4485(88)90138-8","article-title":"Finite element mesh generation methods: A review and classification","volume":"20","author":"Ho-Le","year":"1988","journal-title":"Computer Aided Design"},{"issue":"3","key":"10.1016\/S0925-7721(97)00019-9_BIB21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0010-4485(95)95870-K","article-title":"Quadrilateral mesh generation in polygonal regions","volume":"27","author":"Joe","year":"1995","journal-title":"Computer Aided Design"},{"issue":"1","key":"10.1016\/S0925-7721(97)00019-9_BIB22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/nme.1620310105","article-title":"Automatic conversion of triangular finite meshes to quadrilateral elements","volume":"31","author":"Johnston","year":"1991","journal-title":"Internat. J. Numer. Methods Engrg."},{"issue":"2","key":"10.1016\/S0925-7721(97)00019-9_BIB23","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0604020","article-title":"Traditional galleries require fewer watchmen","volume":"4","author":"Kahn","year":"1983","journal-title":"SIAM J. Algorithms Discrete Methods"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01389968","article-title":"Linear algorithms for testing the sign stability of a matrix and for finding z-maximum matchings in acyclic graphs","volume":"28","author":"Klee","year":"1977","journal-title":"Numer. Math."},{"key":"10.1016\/S0925-7721(97)00019-9_BIB25","doi-asserted-by":"crossref","DOI":"10.1016\/0031-3203(92)90093-X","article-title":"Three-coloring the vertices of a triangulated simple polygon","volume":"25","author":"Kooshesh","year":"1992","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB26","series-title":"Third Workshop on Proximity Graphs","article-title":"Scattered data interpolation using C2 piecewise polynomials of degree six","author":"Lai","year":"1994"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB27","series-title":"Proc. of the 1st ACM Symposium on Computational Geometry","first-page":"97","article-title":"Decomposing polygonal regions into convex quadrilaterals","author":"Lubiw","year":"1985"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB28","series-title":"Proc. 21st Annual IEEE Symposium on the Foundations of Computer Science","first-page":"17","article-title":"An O(|V|12|E|) algorithm for finding maximum matchings in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB29","first-page":"315","article-title":"An algorithm for a minimum cover of a graph","volume":"10","author":"Norman","year":"1959"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB30","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB31","series-title":"Proc. 20th Annual Allerton Conference on Communication, Control and Computing","first-page":"64","article-title":"An O(n log n) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals","author":"Sack","year":"1982"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB32","series-title":"Proc. 19th Annual Allerton Conf. on Communications, Control and Computing","first-page":"21","article-title":"A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals","author":"Sack","year":"1981"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB33","series-title":"Computational Morphology","first-page":"153","article-title":"Guard placement in rectilinear polygons","author":"Sack","year":"1988"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB34","series-title":"Multivariate Approximation Theory","first-page":"396","article-title":"On the dimension of spaces of piecewise polynomials in two variables","author":"Schumaker","year":"1979"},{"issue":"9","key":"10.1016\/S0925-7721(97)00019-9_BIB35","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1109\/5.163413","article-title":"Automatic mesh generation using the symmetric axis transformation of polygonal domains","volume":"80","author":"Srinivasan","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0925-7721(97)00019-9_BIB36","series-title":"Proc. 4th International Workshop on Algorithms and Data Structures (WADS)","first-page":"218","article-title":"Quadrangulations of planar sets","volume":"955","author":"Toussaint","year":"1995"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:27:22Z","timestamp":1555975642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0925772197000199"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00019-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}