RT‐HDIST: Ray‐Tracing Core‐based Hausdorff Distance Computation

The Hausdorff distance is a fundamental metric with widespread applications across various fields. However, its computation remains computationally expensive, especially for large‐scale datasets. This work targets exact point‐to‐point Hausdorff distance on point sets. In this work, we present RT‐HDI...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer graphics forum Ročník 44; číslo 7
Hlavní autoři: Kim, Young Woo, Lee, Jaehong, Kim, Duksu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Blackwell Publishing Ltd 01.10.2025
Témata:
ISSN:0167-7055, 1467-8659
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The Hausdorff distance is a fundamental metric with widespread applications across various fields. However, its computation remains computationally expensive, especially for large‐scale datasets. This work targets exact point‐to‐point Hausdorff distance on point sets. In this work, we present RT‐HDIST, the first Hausdorff distance algorithm accelerated by ray‐tracing cores (RT‐cores). By reformulating the Hausdorff distance problem as a series of nearest‐neighbor searches and introducing a novel quantized voxel‐index space, RT‐HDIST achieves significant reductions in computational overhead while maintaining exact results. Extensive benchmarks demonstrate up to a two‐order‐of‐magnitude speedup over prior state‐of‐the‐art methods, underscoring RT‐HDIST's potential for real‐time and large‐scale applications.
AbstractList The Hausdorff distance is a fundamental metric with widespread applications across various fields. However, its computation remains computationally expensive, especially for large‐scale datasets. This work targets exact point‐to‐point Hausdorff distance on point sets. In this work, we present RT‐HDIST, the first Hausdorff distance algorithm accelerated by ray‐tracing cores (RT‐cores). By reformulating the Hausdorff distance problem as a series of nearest‐neighbor searches and introducing a novel quantized voxel‐index space, RT‐HDIST achieves significant reductions in computational overhead while maintaining exact results. Extensive benchmarks demonstrate up to a two‐order‐of‐magnitude speedup over prior state‐of‐the‐art methods, underscoring RT‐HDIST's potential for real‐time and large‐scale applications.
Author Kim, Duksu
Kim, Young Woo
Lee, Jaehong
Author_xml – sequence: 1
  givenname: Young Woo
  orcidid: 0000-0003-3341-1714
  surname: Kim
  fullname: Kim, Young Woo
  organization: Korea University of Technology and Education (KOREATECH)
– sequence: 2
  givenname: Jaehong
  orcidid: 0000-0002-8311-5975
  surname: Lee
  fullname: Lee, Jaehong
  organization: Korea University of Technology and Education (KOREATECH)
– sequence: 3
  givenname: Duksu
  orcidid: 0000-0002-9075-3983
  surname: Kim
  fullname: Kim, Duksu
  email: bluekdct@gmail.com
  organization: Korea University of Technology and Education (KOREATECH)
BookMark eNp1kEtOwzAQhi1UJNrCghtEYsUirWPHccIOpU-pElIJa8vPKlUbFzsR6q5H4IycBEPYMpuZX_PNjOYfgUFjGw3AfQInSYip3JkJhQgVV2CYpBmN84wUAzCESagpJOQGjLzfQwhTmpEhmG-rr8vnarZ-rZ6iLT8HUTku62YXldbpIAX3WkUr3nllnTHRrPYtb6QO_eOpa3lb2-YWXBt-8PruL4_B22Jelat487Jcl8-bWCJSFLEgeY5RonJjCopSldAcp0pxJLSkEnOJKSXCQJEKgVUhlDBGSQIx1lkOqcJj8NDvPTn73mnfsr3tXBNOMoyy8CKiBAXqsaeks947bdjJ1UfuziyB7MclFlxivy4FdtqzH_VBn_8HWblc9BPfyNdsiQ
Cites_doi 10.14778/3665844.3665858
10.1109/TKDE.2024.3453901
10.14778/2002974.2002978
10.14778/3625054.3625063
10.1007/s00371-010-0477-3
10.1016/j.patcog.2021.107857
10.1111/j.1467-8659.2009.01611.x
10.1145/3650200.3656601
10.1109/TVCG.2013.71
10.1109/TPAMI.2015.2408351
10.1016/j.cad.2011.08.022
10.1145/1531326.1531380
10.1007/3-540-45344-X_14
10.1145/3388333.3388662
10.1145/3577193.3593738
10.1109/ACCESS.2017.2778745
10.1109/IPDPS54959.2023.00100
10.1109/ROBOT.2000.845311
10.1145/3503221.3508409
10.1109/MM.2020.2971677
10.1016/j.future.2024.03.040
10.1002/cpe.6663
ContentType Journal Article
Copyright 2025 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.
2025 The Eurographics Association and John Wiley & Sons Ltd.
Copyright_xml – notice: 2025 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.
– notice: 2025 The Eurographics Association and John Wiley & Sons Ltd.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1111/cgf.70229
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList CrossRef
Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1467-8659
EndPage n/a
ExternalDocumentID 10_1111_cgf_70229
CGF70229
Genre article
GrantInformation_xml – fundername: National Research Foundation of Korea (NRF)
– fundername: Ministry of Education
  funderid: 2021R1I1A3048263 (70%); RS‐2024‐00410511 (30%)
GroupedDBID .3N
.4S
.DC
.GA
.Y3
05W
0R~
10A
15B
1OB
1OC
29F
31~
33P
3SF
4.4
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5GY
5HH
5LA
5VS
66C
6J9
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
8VB
930
A03
AAESR
AAEVG
AAHQN
AAMMB
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABDBF
ABDPE
ABEML
ABPVW
ACAHQ
ACBWZ
ACCZN
ACFBH
ACGFS
ACPOU
ACRPL
ACSCC
ACUHS
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADMLS
ADNMO
ADOZA
ADXAS
ADZMN
AEFGJ
AEGXH
AEIGN
AEIMD
AEMOZ
AENEX
AEUYR
AEYWJ
AFBPY
AFEBI
AFFNX
AFFPM
AFGKR
AFWVQ
AFZJQ
AGHNM
AGQPQ
AGXDD
AGYGG
AHBTC
AHEFC
AHQJS
AIDQK
AIDYY
AIQQE
AITYG
AIURR
AJXKR
AKVCP
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ARCSS
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BMXJE
BNHUX
BROTX
BRXPI
BY8
CAG
COF
CS3
CWDTD
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EAD
EAP
EBA
EBO
EBR
EBS
EBU
EDO
EJD
EMK
EST
ESX
F00
F01
F04
F5P
FEDTE
FZ0
G-S
G.N
GODZA
H.T
H.X
HF~
HGLYW
HVGLF
HZI
HZ~
I-F
IHE
IX1
J0M
K1G
K48
LATKE
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
NF~
O66
O9-
OIG
P2W
P2X
P4D
PALCI
PQQKQ
Q.N
Q11
QB0
QWB
R.K
RDJ
RIWAO
RJQFR
ROL
RX1
SAMSI
SUPJJ
TH9
TN5
TUS
UB1
V8K
W8V
W99
WBKPD
WIH
WIK
WOHZO
WQJ
WXSBR
WYISQ
WZISG
XG1
ZL0
ZZTAW
~IA
~IF
~WT
AAYXX
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c2599-b588321d8ff9724d17834dda2bec7c3ac3775bf0b4bb3d9bdbffdc5033e6807d3
IEDL.DBID DRFUL
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001590867700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-7055
IngestDate Sat Oct 18 22:58:40 EDT 2025
Sat Nov 29 07:08:13 EST 2025
Thu Oct 16 09:53:06 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2599-b588321d8ff9724d17834dda2bec7c3ac3775bf0b4bb3d9bdbffdc5033e6807d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8311-5975
0000-0002-9075-3983
0000-0003-3341-1714
PQID 3261672752
PQPubID 30877
PageCount 10
ParticipantIDs proquest_journals_3261672752
crossref_primary_10_1111_cgf_70229
wiley_primary_10_1111_cgf_70229_CGF70229
PublicationCentury 2000
PublicationDate October 2025
2025-10-00
20251001
PublicationDateYYYYMMDD 2025-10-01
PublicationDate_xml – month: 10
  year: 2025
  text: October 2025
PublicationDecade 2020
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Computer graphics forum
PublicationYear 2025
Publisher Blackwell Publishing Ltd
Publisher_xml – name: Blackwell Publishing Ltd
References 2017; 6
2015; 37
2020; 40
2000; 4
2023; 16
2022; 41
2004
2025
2024
2011; 4
2024; 17
2009; 28
2013; 19
2010; 26
2023
2001
2022
2010; 29
2020
2021; 114
2022; 34
2019
2011; 43
2024; 43
2024; 157
e_1_2_9_10_2
e_1_2_9_12_2
e_1_2_9_31_2
e_1_2_9_11_2
e_1_2_9_14_2
e_1_2_9_13_2
e_1_2_9_16_2
e_1_2_9_15_2
e_1_2_9_18_2
e_1_2_9_17_2
e_1_2_9_19_2
Zheng Y. (e_1_2_9_30_2) 2022
Sacht L. (e_1_2_9_21_2) 2024
e_1_2_9_20_2
e_1_2_9_23_2
e_1_2_9_22_2
e_1_2_9_7_2
e_1_2_9_6_2
e_1_2_9_4_3
e_1_2_9_5_2
e_1_2_9_4_2
e_1_2_9_3_2
e_1_2_9_2_2
e_1_2_9_9_2
e_1_2_9_8_2
e_1_2_9_25_2
e_1_2_9_24_2
e_1_2_9_27_2
e_1_2_9_26_2
e_1_2_9_29_2
e_1_2_9_28_2
References_xml – volume: 34
  issue: 4
  year: 2022
  article-title: Multi-GPU room response simulation with hardware raytracing
  publication-title: Concurrency and Computation: Practice and Experience
– volume: 6
  start-page: 1350
  year: 2017
  end-page: 1361
  article-title: Efficient and accurate Hausdorff distance computation based on diffusion search
  publication-title: IEEE Access
– volume: 40
  start-page: 36
  issue: 2
  year: 2020
  end-page: 44
  article-title: RTX on—The NVIDIA Turing GPU
  publication-title: IEEE Micro
– volume: 157
  start-page: 98
  year: 2024
  end-page: 111
  article-title: Accelerating range minimum queries with ray tracing cores
  publication-title: Future Generation Computer Systems
– start-page: 289
  year: 2023
  end-page: 300
– volume: 4
  start-page: 3719
  year: 2000
  end-page: 3726
  publication-title: IEEE International Conference on Robotics and Automation
– year: 2024
– volume: 16
  start-page: 4268
  issue: 13
  year: 2023
  end-page: 4281
  article-title: RTIndeX: Exploiting Hardware-Accelerated GPU Raytracing for Database Indexing
  publication-title: Proceedings of the VLDB Endowment
– start-page: 14
  year: 2024
  end-page: 25
– start-page: 90
  year: 2001
  end-page: 95
  article-title: Robust face detection using the hausdorff distance
– volume: 17
  start-page: 2293
  issue: 9
  year: 2024
  end-page: 2306
  article-title: Trajectory Similarity Measurement: An Efficiency Perspective
  publication-title: Proc. VLDB Endow.
– volume: 29
  start-page: 419
  issue: 2
  year: 2010
  end-page: 428
  article-title: gProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
  publication-title: Computer Graphics Forum
– volume: 43
  start-page: 1370
  issue: 11
  year: 2011
  end-page: 1379
  article-title: GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces
  publication-title: Computer-Aided Design
– volume: 41
  start-page: 46
  year: 2022
  end-page: 56
– start-page: 76
  year: 2022
  end-page: 89
– volume: 37
  start-page: 2153
  issue: 11
  year: 2015
  end-page: 2163
  article-title: An efficient algorithm for calculating the exact Hausdorff distance
  publication-title: IEEE transactions on pattern analysis and machine intelligence
– volume: 43
  year: 2024
– year: 2025
– year: 2020
– year: 2004
– year: 2023
– start-page: 7
  year: 2019
  end-page: 13
– volume: 28
  start-page: 1
  issue: 3
  year: 2009
  end-page: 9
  article-title: Interactive Hausdorff distance computation for general polygonal models
  publication-title: ACM Transactions on Graphics (TOG)
– volume: 4
  start-page: 506
  issue: 8
  year: 2011
  end-page: 517
  article-title: An incremental haus-dorff distance calculation algorithm
  publication-title: Proceedings of the VLDB Endowment
– volume: 19
  start-page: 1513
  issue: 9
  year: 2013
  end-page: 1525
  article-title: Scheduling in Heterogeneous Computing Environments for Proximity Queries
  publication-title: IEEE Transactions on Visualization and Computer Graphics
– volume: 114
  start-page: 107857
  year: 2021
  article-title: An efficient computational algorithm for Hausdorff distance based on points-ruling-out and systematic random sampling
  publication-title: Pattern Recognition
– start-page: 1
  year: 2020
  end-page: 11
– volume: 26
  start-page: 1007
  year: 2010
  end-page: 1016
  article-title: Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer
  publication-title: The Visual Computer
– start-page: e15129
  volume-title: Computer Graphics Forum
  year: 2024
  ident: e_1_2_9_21_2
– ident: e_1_2_9_4_3
  doi: 10.14778/3665844.3665858
– ident: e_1_2_9_28_2
  doi: 10.1109/TKDE.2024.3453901
– ident: e_1_2_9_27_2
– ident: e_1_2_9_2_2
– ident: e_1_2_9_15_2
  doi: 10.14778/2002974.2002978
– ident: e_1_2_9_5_2
  doi: 10.14778/3625054.3625063
– ident: e_1_2_9_10_2
  doi: 10.1007/s00371-010-0477-3
– start-page: 46
  volume-title: Computer Graphics Forum
  year: 2022
  ident: e_1_2_9_30_2
– ident: e_1_2_9_18_2
  doi: 10.1016/j.patcog.2021.107857
– ident: e_1_2_9_12_2
  doi: 10.1111/j.1467-8659.2009.01611.x
– ident: e_1_2_9_14_2
  doi: 10.1145/3650200.3656601
– ident: e_1_2_9_8_2
  doi: 10.1109/TVCG.2013.71
– ident: e_1_2_9_4_2
  doi: 10.14778/3665844.3665858
– ident: e_1_2_9_23_2
  doi: 10.1109/TPAMI.2015.2408351
– ident: e_1_2_9_9_2
  doi: 10.1016/j.cad.2011.08.022
– ident: e_1_2_9_24_2
  doi: 10.1145/1531326.1531380
– ident: e_1_2_9_6_2
– ident: e_1_2_9_7_2
  doi: 10.1007/3-540-45344-X_14
– ident: e_1_2_9_22_2
– ident: e_1_2_9_26_2
  doi: 10.1145/3388333.3388662
– ident: e_1_2_9_17_2
  doi: 10.1145/3577193.3593738
– ident: e_1_2_9_20_2
– ident: e_1_2_9_31_2
  doi: 10.1109/ACCESS.2017.2778745
– ident: e_1_2_9_16_2
  doi: 10.1109/IPDPS54959.2023.00100
– ident: e_1_2_9_19_2
– ident: e_1_2_9_11_2
  doi: 10.1109/ROBOT.2000.845311
– ident: e_1_2_9_29_2
  doi: 10.1145/3503221.3508409
– ident: e_1_2_9_3_2
  doi: 10.1109/MM.2020.2971677
– ident: e_1_2_9_13_2
  doi: 10.1016/j.future.2024.03.040
– ident: e_1_2_9_25_2
  doi: 10.1002/cpe.6663
SSID ssj0004765
Score 2.4472337
Snippet The Hausdorff distance is a fundamental metric with widespread applications across various fields. However, its computation remains computationally expensive,...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Index Database
Publisher
SubjectTerms CCS Concepts
Computation
Computing methodologies → Shape analysis
Mesh geometry models
Metric space
Parallel algorithms
Ray tracing
Title RT‐HDIST: Ray‐Tracing Core‐based Hausdorff Distance Computation
URI https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.70229
https://www.proquest.com/docview/3261672752
Volume 44
WOSCitedRecordID wos001590867700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1467-8659
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004765
  issn: 0167-7055
  databaseCode: DRFUL
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LSsNAFL3U1oUufIvVKkFcuIl08pqMrqRtrCBFagvdhcxL3DSStII7P8Fv9EucmSRtXQiCuwxJhnDn3twzM3fOAbhgPmaBxNIOGSe2FyLPJgqI2iqShIdIEvCAGrEJPBiEkwl5rMFNdRam4IdYLLjpyDD_ax3gCc1Xgpw9yyusMhBZg4aj_NarQ6M7jMYPy2OROPAram9NGlMSC-lCnsXLP9PREmOuIlWTaqLtf33kDmyVCNO6LVxiF2piugebK7yD-9Abjr4-Pvvd-6fRtTVM3lVD5Sym7lmdNBOqqZMbt_rJPOdpJqXV1TBT-YdVqECY4TyAcdQbdfp2qadgMzXJITb1Q61LxEMpCXY8jrTIBueJo8YRMzdhLsY-lW3qUepyQjmVkjO9zymCsI25ewj1aToVR7ogijDkCMKpqyd4MpFceBQhSSRimDtNOK_MGr8WtBlxNd1QNomNTZrQqgwel5GTxwpOIr077Ks-Lo1pf-8g7txF5uL474-ewIajJXxNPV4L6rNsLk5hnb3NXvLsrHShb6YBy88
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7MTVAfvIvTqUV88KWy9JZGfJFd7HAOmR3srTRJI75s0m2Cb_4Ef6O_xCRtt_kgCL41tA3l5JyeL8nJ9wFcMBczT2Bh-owT0_GRYxIJRE0ZSYmDSOxxj2qxCdzr-cMheSzBTXEWJuOHmC-4qcjQ_2sV4GpBeinK2bO4wjIFkRWoONKN3DJUmv32oLs4F4k9t-D2VqwxObOQquSZv_wzHy1A5jJU1bmmvfW_r9yGzRxjGreZU-xAKRntwsYS8-AetPrh18dn0Ow8hddGP36XDZm1mLxnNMZpIpsqvXEjiGcTPk6FMJoKaEoPMTIdCD2g-zBot8JGYOaKCiaT0xxiUtdXykTcF4Jgy-FIyWxwHltyJDGzY2Zj7FJRpw6lNieUUyE4UzudiefXMbcPoDwaj5JDVRJFGLISwqmtpngiFjxxKEKCCMQwt6pwXtg1es2IM6JiwiFtEmmbVKFWWDzKY2cSSUCJ1P6wK_u41Lb9vYOocdfWF0d_f_QM1oLwoRt1O737Y1i3lKCvrs6rQXmazpITWGVv05dJepr70zfe-c-_
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA5zE9EH7-J0ahEffKksvaURX2S1bjjGmBvsrTQ5ifiyjW4TfPMn-Bv9JSa9bPNBEHxraBvKyfl6viQn50PoiruEe5JI0-dATcfHjkkVETUVkoSDaeyBx1KxCdLp-MMh7ZbQXXEWJqsPsVhw08hI_9ca4GICcgXl_EXeEBWC6BqqOC71FCwrQS8ctJfnIonnFrW9ddWYvLKQzuRZvPwzHi1J5ipVTWNNuPO_r9xF2znHNO4zp9hDJTHaR1srlQcP0EOv__Xx2Qxaz_1boxe_q4aKWlzdMxrjRKimDm9gNOP5FMaJlEagiabyECPTgUgH9BANwod-o2nmigomV9McajLX18pE4EtJieUA1jIbALGlRpJwO-Y2IS6TdeYwZgNlwKQErnc6hefXCdhHqDwaj8SxTomiHFuCArP1FE_GEoTDMJZUYk7AqqLLwq7RJCucERUTDmWTKLVJFdUKi0c5dqaRIpRY7w-7qo_r1La_dxA1HsP04uTvj16gjW4QRu1W5-kUbVpazzdNzquh8iyZizO0zt9mr9PkPHenb7Iyzzo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=RT%E2%80%90HDIST%3A+Ray%E2%80%90Tracing+Core%E2%80%90based+Hausdorff+Distance+Computation&rft.jtitle=Computer+graphics+forum&rft.au=Kim%2C+Young+Woo&rft.au=Lee%2C+Jaehong&rft.au=Kim%2C+Duksu&rft.date=2025-10-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=44&rft.issue=7&rft_id=info:doi/10.1111%2Fcgf.70229&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon