{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:53:36Z","timestamp":1715061216190},"reference-count":27,"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(96)00016-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:57:07Z","timestamp":1051127827000},"page":"197-210","source":"Crossref","is-referenced-by-count":28,"title":["On fat partitioning, fat covering and the union size of polygons"],"prefix":"10.1016","volume":"9","author":[{"given":"Marc","family":"van Kreveld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00016-8_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0219020","article-title":"Red-blue intersection detection algorithms, with applications to motion planning and collision detection","volume":"19","author":"Agarwal","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02189304","article-title":"Applications of a new partitioning scheme","volume":"9","author":"Agarwal","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF01758853","article-title":"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures","volume":"8","author":"Alt","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0925-7721(96)00016-8_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0925-7721(92)90007-F","article-title":"Hidden surface removal for c-oriented polyhedra","volume":"1","author":"de Berg","year":"1992","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB6","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","first-page":"210","article-title":"Filling polyhedral molds","volume":"709","author":"Bose","year":"1993"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","article-title":"Cutting hyperplanes for divide-and-conquer","volume":"9","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB8","series-title":"Proc. 6th Internat. Sympos. Algorithms Computations (ISAAC'95)","first-page":"382","article-title":"Finding the medial axis of a simple polygon in linear time","volume":"1004","author":"Chin","year":"1995"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","article-title":"Visibility problems for polyhedral terrains","volume":"7","author":"Cole","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB10","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"issue":"5","key":"10.1016\/S0925-7721(96)00016-8_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0925-7721(93)90018-2","article-title":"On the union of fat wedges and separating a collection of segments by a line","volume":"3","author":"Efrat","year":"1993","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB12","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BF02187745","article-title":"On arrangements of Jordan arcs with three intersections per pair","volume":"4","author":"Edelsbrunner","year":"1989","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/S0925-7721(96)00016-8_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","article-title":"Efficient hidden surface removal for objects with small union size","volume":"2","author":"Katz","year":"1992","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB15_1","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","first-page":"452","article-title":"On fat covering, fat partitioning and the union size of polygons (extended abstract)","volume":"709","author":"van Kreveld","year":"1993"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB15_2","article-title":"On fat covering, fat partitioning and the union size of polygons (extended abstract)","author":"van Kreveld","year":"1993"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB16","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","article-title":"Generalization of Voronoi diagrams in the plane","volume":"10","author":"Lee","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","article-title":"Range searching with efficient hierarchical cuttings","volume":"10","author":"Matou\u0161ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB19","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1137\/S009753979018330X","article-title":"Fat triangles determine linearly many holes","volume":"23","author":"Matou\u0161ek","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB20","series-title":"Efficient randomized algorithms for constructing the union of fat triangles and of pseudodiscs","author":"Miller","year":"1993"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(92)90211-D","article-title":"Point location in fat subdivisions","volume":"44","author":"Overmars","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(96)00016-8_BIB22","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB23","series-title":"Proc. IEEE Internat. Conf. on Robotics and Automation","first-page":"1326","article-title":"Efficient algorithms for planning purely translational collision-free motion in two and three dimensions","author":"Sharir","year":"1987"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB24","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF02574706","article-title":"On k-sets in arrangements of curves and surfaces","volume":"6","author":"Sharir","year":"1991","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"10.1016\/S0925-7721(96)00016-8_BIB25","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","article-title":"The complexity of free space for a robot moving amidst fat obstacles","volume":"3","author":"van der Stappen","year":"1993","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00016-8_BIB26","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geom."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:55:44Z","timestamp":1556675744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0925772196000168"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00016-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}