Searching simplexes in quasi-triangulation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Deok-Soo | - |
dc.contributor.author | Kim, Jae-Kwan | - |
dc.contributor.author | Kim, Chong-Min | - |
dc.date.accessioned | 2022-12-20T16:25:34Z | - |
dc.date.available | 2022-12-20T16:25:34Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2010-07 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/174449 | - |
dc.description.abstract | Given a quasi-triangulation of a molecule, searching the simplexes of a particular bounding state for the spherical probe of a given radius occurs frequently. While such simplexes can be found by linearly scanning all simplexes in the quasi-triangulation, it is desirable to do the search faster. This paper presents an algorithm for searching simplexes quickly using the fed-tree data structure. The approach is based on the transformation of the simplex search problem in the R3 space to the orthogonal range search problem of points in another R3 space. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | Searching simplexes in quasi-triangulation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1109/ISVD.2010.34 | - |
dc.identifier.scopusid | 2-s2.0-77955696028 | - |
dc.identifier.bibliographicCitation | ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering, pp.105 - 111 | - |
dc.relation.isPartOf | ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering | - |
dc.citation.title | ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering | - |
dc.citation.startPage | 105 | - |
dc.citation.endPage | 111 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Beta-complex | - |
dc.subject.keywordPlus | Beta-shape | - |
dc.subject.keywordPlus | Orthogonal range search | - |
dc.subject.keywordPlus | Particle proximity | - |
dc.subject.keywordPlus | Quasi-triangulation | - |
dc.subject.keywordPlus | Simplex search | - |
dc.subject.keywordPlus | Voronoi diagrams | - |
dc.subject.keywordPlus | Computational geometry | - |
dc.subject.keywordPlus | Data structures | - |
dc.subject.keywordPlus | Graphic methods | - |
dc.subject.keywordPlus | Probes | - |
dc.subject.keywordPlus | Spheres | - |
dc.subject.keywordPlus | Trees (mathematics) | - |
dc.subject.keywordPlus | Triangulation | - |
dc.subject.keywordAuthor | Beta-complex | - |
dc.subject.keywordAuthor | Beta-shape | - |
dc.subject.keywordAuthor | Orthogonal range search | - |
dc.subject.keywordAuthor | Particle proximity | - |
dc.subject.keywordAuthor | Quasi-triangulation | - |
dc.subject.keywordAuthor | Simplex search | - |
dc.subject.keywordAuthor | Voronoi diagram of spheres | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/5521415 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.