{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:03:53Z","timestamp":1648609433870},"reference-count":39,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0010-4485(02)00099-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T23:49:40Z","timestamp":1049500180000},"page":"693-705","source":"Crossref","is-referenced-by-count":2,"title":["Reducing feasible contacts between polyhedral models to red\u2013blue intersections on the sphere"],"prefix":"10.1016","volume":"35","author":[{"given":"P.","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Torras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0010-4485(02)00099-4_BIB1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1177\/02783640122067499","article-title":"An orientation-based pruning tool to speed up interference detection between translating polyhedral models","volume":"20","author":"Jim\u00e9nez","year":"2001","journal-title":"Int J Robotics Res"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB2","doi-asserted-by":"crossref","unstructured":"Gottschalk S, Lin MC, Manocha D. Obb-tree: a hierarchical structure for rapid interference detection. Proceedings of ACM Siggraph'96, New Orleans, LA; 1996. p. 171\u201380, http:\/\/www.cs.unc.edu\/~geom\/OBB\/OBBT.html.","DOI":"10.1145\/237170.237244"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB3","unstructured":"Larsen E, Gottschalk S, Lin M, Manocha D. Fast proximity queries with swept sphere volumes. Technical Report TR99-018. Department of Computer Science, UNC Chapel Hill, http:\/\/www.cs.unc.edu\/~geom\/SSV\/; 1999."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB4","unstructured":"Brown K. Geometric transformations for fast geometric algorithms. PhD Thesis. Department of Computer Science, Carnegie Mellon University; 1980."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB5","series-title":"Spatial tessellations: concepts and applications of Voronoi diagrams","author":"Okabe","year":"1992"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB6","unstructured":"Sacristan V. Geometric optimization and applications in visibility (in spanish). PhD Thesis. Dept. de Matem\u00e0tica Aplicada II, Universitat Polit\u00e8cnica de Catalunya; 1997."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB7","series-title":"Computational geometry on surfaces","author":"Grima","year":"2001"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB8","series-title":"Geometry and the imagination","author":"Hilbert","year":"1987"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB9","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1109\/PROC.1984.13073","article-title":"Extended gaussian images","volume":"72","author":"Horn","year":"1984","journal-title":"Proc IEEE"},{"issue":"2","key":"10.1016\/S0010-4485(02)00099-4_BIB10","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1115\/1.2916945","article-title":"Computational geometry on the sphere for automated machining","volume":"114","author":"Chen","year":"1992","journal-title":"ASME J Mech Des"},{"issue":"2","key":"10.1016\/S0010-4485(02)00099-4_BIB11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1115\/1.2919386","article-title":"Spherical maps: their construction, properties and approximation","volume":"116","author":"Gan","year":"1994","journal-title":"ASME J Mech Des"},{"issue":"3","key":"10.1016\/S0010-4485(02)00099-4_BIB12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1115\/1.2926576","article-title":"Maximum intersection of spherical polygons and workpiece orientation for 4- and 5-axis machining","volume":"114","author":"Tang","year":"1992","journal-title":"ASME J Mech Des"},{"issue":"4","key":"10.1016\/S0010-4485(02)00099-4_BIB13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/159730.159732","article-title":"Separating and intersecting spherical polygons: computing machinability on three-, four, and five-axis numerically controlled machines","volume":"12","author":"Chen","year":"1993","journal-title":"ACM Trans Graphics"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB14","series-title":"4th International Workshop, WADS'95","first-page":"171","article-title":"Efficient geometric algorithms for workpiece orientation in 4- and 5-axis nc-machining","volume":"vol. LNCS,955","author":"Gupta","year":"1995"},{"issue":"2","key":"10.1016\/S0010-4485(02)00099-4_BIB15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0004-3702(94)90048-5","article-title":"Geometric reasoning about mechanical assembly","volume":"71","author":"Wilson","year":"1994","journal-title":"Artif Intell"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB16","doi-asserted-by":"crossref","unstructured":"Halperin D, Latombe J-C, Wilson RH. A general framework for assembly planning: the motion space approach. Proceedings of the 14th Annual Symposium on Computational Geometry, Minneapolis, MN. Algorithmica ; ():\u2013.","DOI":"10.1145\/276884.276886"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB17","unstructured":"Basch J, Guibas LJ, Ramkumar GD, Ramshaw L. Polyhedral tracings and their convolution. Workshop on Algorithmic Foundations of Robotics; 1996."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB18","doi-asserted-by":"crossref","unstructured":"Guibas L, Seidel R. Computing convolution by reciprocal search. Proceedings of the ACM Symposium on Computational Geometry, Yorktown Heights, NY; 1986.","DOI":"10.1145\/10515.10525"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB19","doi-asserted-by":"crossref","unstructured":"Andrade MVA, Stolfi J. Exact algorithms for circles on the sphere. Symposium on Computational Geometry; 1998. p. 126\u201334, URL: http:\/\/citeseer.nj.nec.com\/326577.html.","DOI":"10.1145\/276884.276898"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB20","doi-asserted-by":"crossref","unstructured":"Goldwasser M. An implementation for maintaining arrangements of polygons. Proceedings of the 11th Symposium on Computational Geometry; 1995. ACM, Vancouver, BC, p. C32\u20133.","DOI":"10.1145\/220279.220337"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB21","doi-asserted-by":"crossref","unstructured":"Basch J, Guibas LJ, Ramkumar GD. Reporting red\u2013blue intersections between connected sets of line segments. 4th European Symposium on Algorithms; 1966, p. 302\u201319.","DOI":"10.1007\/3-540-61680-2_64"},{"issue":"2","key":"10.1016\/S0010-4485(02)00099-4_BIB22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0097-8493(00)00130-8","article-title":"Collision detection: a survey","volume":"25","author":"Jim\u00e9nez","year":"2001","journal-title":"Comput Graphics"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB23","doi-asserted-by":"crossref","unstructured":"Thomas F, Torras C. Interference detection between non-convex polyhedra revisited with a practical aim. Proceedings of the IEEE International Conference on Robotics and Automation, vol. 1, San Diego, CA; 1994. p. 587\u201394.","DOI":"10.1109\/ROBOT.1994.351236"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB24","doi-asserted-by":"crossref","unstructured":"Thomas F, Torras C. A projectively invariant intersection test for polyhedra. The Visual Computer 18.","DOI":"10.1007\/s003710100158"},{"issue":"3","key":"10.1016\/S0010-4485(02)00099-4_BIB25","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(87)90069-5","article-title":"A search algorithm for motion planning with six degrees of freedom","volume":"31","author":"Donald","year":"1987","journal-title":"Artif Intell"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB26","unstructured":"Jim\u00e9nez P. Static and dynamic interference detection between non-convex polyhedra. PhD Thesis. Universitat Polit\u00e8cnica de Catalunya, http:\/\/www-iri.upc.es\/people\/jimenez\/phdthesis.html; 1998."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB27","doi-asserted-by":"crossref","unstructured":"Mairson HG, Stolfi J. Theoretical foundations of computer graphics and CAD. Ch. Reporting and counting intersections between two sets of line segments; vol. F40, 1988. p. 307\u201325.","DOI":"10.1007\/978-3-642-83539-1_11"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB28","unstructured":"Chan TM. A simple trapezoid sweep algorithm for reporting red\/blue segment intersections. 6th Canadian Conference on Computational Geometry; 1994. p. 263\u20138."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB29","doi-asserted-by":"crossref","unstructured":"Palazzi L, Snoeyink J. Counting and reporting red\/blue segment intersections. Lecture Notes in Computer Science, vol. Proceedings of the 3rd Workshop Algorithms Data Structure; 1993, p. 530\u201340.","DOI":"10.1007\/3-540-57155-8_277"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB30","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01182771","article-title":"Algorithms for bichromatic line segment problems and polyhedral terrains","volume":"11","author":"Chazelle","year":"1994","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0010-4485(02)00099-4_BIB31","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0219020","article-title":"Red\u2013blue 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\/S0010-4485(02)00099-4_BIB32","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02187809","article-title":"Partitioning arrangements of lines. ii. Applications","volume":"5","author":"Agarwal","year":"1990","journal-title":"Discrete Comput Geom"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB33","doi-asserted-by":"crossref","unstructured":"Chan TM. Dynamic planar convex hull operations in near-logarithmic amortized time. IEEE Symposium on Foundations of Computer Science; 1999. p. 92\u20139, URL: http:\/\/citeseer.nj.nec.com\/chan99dynamic.html.","DOI":"10.1109\/SFFCS.1999.814581"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB34","doi-asserted-by":"crossref","unstructured":"Har-Peled S, Sharir M. Line point location in planar arrangements and its applications. Proceedings of 12th ACM-SIAM Symposium Discrete Algorithms, Washington, DC; 2001, vol. 1, p. 57\u201366. URL: http:\/\/citeseer.nj.nec.com\/har-peled99line.html.","DOI":"10.1007\/s00454-001-0026-y"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB35","doi-asserted-by":"crossref","unstructured":"Aharoni Y, Halperin D, Hanniel I, Har-Peled S, Linhart C. On-line zone construction in arrangements of lines in the plane. Lecture Notes in Computer Science, vol. Proc. 3rd Workshop on Algorithm Engineering (WAE'99), London, UK; 1999, p. 139\u201353. URL: http:\/\/citeseer.nj.nec.com\/299664.html.","DOI":"10.1007\/3-540-48318-7_13"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB36","doi-asserted-by":"crossref","unstructured":"Aragon CR, Seidel RG. Randomized search trees. Proceedings of the 30th Annual IEEE Symposium Found. Computer Science; 1989. p. 540\u20135.","DOI":"10.1109\/SFCS.1989.63531"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB37","unstructured":"Jim\u00e9nez P. Orientation-based pruning for collision detection, http:\/\/www-iri.upc.es\/people\/jimenez\/mycoldec.html; 2002."},{"key":"10.1016\/S0010-4485(02)00099-4_BIB38","doi-asserted-by":"crossref","unstructured":"Johnson DE, Cohen E. Spatialized normal cone hierarchies. ACM Symposium on Interactive 3D Graphics, ACM SIGGRAPH; 2001. URL: http:\/\/citeseer.nj.nec.com\/446423.html.","DOI":"10.1145\/364338.364380"},{"key":"10.1016\/S0010-4485(02)00099-4_BIB39","series-title":"Utilities","first-page":"394","article-title":"Fast polygon triangulation based on Seidel's algorithm","author":"Narkhede","year":"1995"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448502000994?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448502000994?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T14:11:35Z","timestamp":1583417495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448502000994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0010448502000994"],"URL":"https:\/\/doi.org\/10.1016\/s0010-4485(02)00099-4","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}