{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:57:55Z","timestamp":1775080675758,"version":"3.50.1"},"reference-count":11,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5508,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Visual. Comput. Animat."],"published-print":{"date-parts":[[1991,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Interference detection is a useful technique, but it is also generally time\u2010consuming. In this paper, a new type of interference detection algorithm is proposed for real\u2010time interference detection. The algorithm first rasterizes the projection of the target objects and calculates the <jats:italic>z<\/jats:italic>\u2010values, just as done by the <jats:italic>z<\/jats:italic>\u2010buffer visible surface algorithm. For interference detection, all <jats:italic>z<\/jats:italic>\u2010values and pointers to the corresponding faces of objects are saved in a <jats:italic>z<\/jats:italic>\u2010list for each pixel. Sorting the <jats:italic>z<\/jats:italic>\u2010list against the <jats:italic>z<\/jats:italic>\u2010values allows the detection of overlapping objects in the <jats:italic>z<\/jats:italic>\u2010direction at each pixel position and, thus, finds interfering faces by referring to the face pointers in the <jats:italic>z<\/jats:italic>\u2010list.<\/jats:p><jats:p>The algorithm is simple and easy to implement. Its computational complexity is directly proportional to the number of polygons, and, in addition, standard graphics hardware can be used to greatly accelerate execution. Another advantage is that the algorithm can be applied to all \u2018ray\u2010traceable\u2019 objects, including algebraic surfaces, and procedurally defined objects; traditionally these were not suitable subjects for interference detection.<\/jats:p><jats:p>The algorithm is implemented on a graphics workstation using a standard graphics library. Interference detection at a practical interaction speed is achieved for complicated objects such as polyhedra with thousands of polygons. The algorithm can be used in two ways: for inexpensive interference detection, and as an efficient culling method for more precise collision\/interference detection algorithms.<\/jats:p>","DOI":"10.1002\/vis.4340020408","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T14:21:59Z","timestamp":1163773319000},"page":"132-134","source":"Crossref","is-referenced-by-count":48,"title":["Interference detection through rasterization"],"prefix":"10.1002","volume":"2","author":[{"given":"Mikio","family":"Shinya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie\u2010Claire","family":"Forgue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/359046.359048"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/378456.378530"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/378456.378528"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/38.45810"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1985.1087003"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498900800302"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/15886.15916"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/97880.97915"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/97880.97887"},{"issue":"4","key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/97880.97901","article-title":"Comprehensible rendering of 3\u2010D shapes","volume":"24","author":"Saito T.","year":"1990","journal-title":"Computer Graphics"}],"container-title":["The Journal of Visualization and Computer Animation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fvis.4340020408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/vis.4340020408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T10:24:47Z","timestamp":1698056687000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/vis.4340020408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["10.1002\/vis.4340020408"],"URL":"https:\/\/doi.org\/10.1002\/vis.4340020408","archive":["Portico"],"relation":{},"ISSN":["1049-8907","1099-1778"],"issn-type":[{"value":"1049-8907","type":"print"},{"value":"1099-1778","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}