{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:15:01Z","timestamp":1648804501181},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00043-7","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T18:53:11Z","timestamp":1051210391000},"page":"59-72","source":"Crossref","is-referenced-by-count":0,"title":["Geometric orderings of intersecting translates and their applications"],"prefix":"10.1016","volume":"7","author":[{"given":"Jean-Marc","family":"Robert","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00043-7_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(87)90226-2","article-title":"Efficient algorithms for common transversals","volume":"25","author":"Atallah","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00043-7_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(89)90155-5","article-title":"Lower bounds for line stabbing","volume":"33","author":"Avis","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00043-7_BIB3","series-title":"Proc. 21st Allerton Conf.","first-page":"459","article-title":"On the duality of intersection and closest points","author":"Bajaj","year":"1986"},{"key":"10.1016\/0925-7721(95)00043-7_BIB4","first-page":"100","article-title":"Helly's theorem and its relatives","volume":"7","author":"Danzer","year":"1963"},{"key":"10.1016\/0925-7721(95)00043-7_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"A linear time algorithms for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00043-7_BIB6","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","article-title":"Stabbing line segments","volume":"22","author":"Edelsbrunner","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0925-7721(95)00043-7_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(90)90147-A","article-title":"Covering convex sets with non-overlapping polygons","volume":"81","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(95)00043-7_BIB8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02187778","article-title":"The maximum number of ways to stab n convex non-intersecting sets in the plane is 2n \u2212 2","volume":"5","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00043-7_BIB9","series-title":"Proc. 5th ACM Symp. Comput. Geom.","first-page":"364","article-title":"Stabbing pairwise disjoint translates in linear time","author":"Egyed","year":"1989"},{"key":"10.1016\/0925-7721(95)00043-7_BIB10","series-title":"New Trends in Discrete and Computational Geometry","first-page":"163","article-title":"Geometric transversal theory","author":"Goodman","year":"1993"},{"key":"10.1016\/0925-7721(95)00043-7_BIB11","first-page":"155","article-title":"On intersections of similar sets","volume":"18","author":"Gr\u00fcnbaum","year":"1959","journal-title":"Portugal. Math."},{"key":"10.1016\/0925-7721(95)00043-7_BIB12","first-page":"23","article-title":"\u00dcber Eibereiche mit gemeinsamer Treffgeradem","volume":"16","author":"Hadwiger","year":"1957","journal-title":"Portugal. Math."},{"key":"10.1016\/0925-7721(95)00043-7_BIB13","series-title":"Combinatorial Geometry in the Plane","author":"Hadwiger","year":"1964"},{"key":"10.1016\/0925-7721(95)00043-7_BIB14","doi-asserted-by":"crossref","first-page":"192","DOI":"10.7146\/math.scand.a-12161","article-title":"A conjecture of Gr\u00fcnbaum on common transversals","volume":"59","author":"Katchalski","year":"1986","journal-title":"Math. Scand."},{"key":"10.1016\/0925-7721(95)00043-7_BIB15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02187708","article-title":"Geometric permutations and common transversals","volume":"1","author":"Katchalski","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00043-7_BIB16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(87)90057-4","article-title":"Geometric permutations of disjoint translates of convex sets","volume":"65","author":"Katchalski","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(95)00043-7_BIB17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02187836","article-title":"The different ways of stabbing disjoint convex sets","volume":"7","author":"Katchalski","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00043-7_BIB18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0012-365X(85)90111-6","article-title":"Geometric permutations for convex sets","volume":"54","author":"Katchalski","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(95)00043-7_BIB19","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00043-7_BIB20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02187722","article-title":"Proof of Gr\u00fcnbaum's conjecture on common transversals for translates","volume":"4","author":"Tverberg","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00043-7_BIB21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02187799","article-title":"A generalization of Hadwiger's theorem to intersecting sets","volume":"5","author":"Wenger","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00043-7_BIB22","article-title":"Geometric permutations and connected components","author":"Wenger","year":"1990"},{"key":"10.1016\/0925-7721(95)00043-7_BIB23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02187777","article-title":"Upper bounds on geometric permutations for convex sets","volume":"5","author":"Wenger","year":"1990","journal-title":"Discrete Comput. Geom."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:25:02Z","timestamp":1555197902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0925772195000437"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00043-7","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}