Distance Measurements of CAD Models in Boundary Representation

Ulrich Krispel; Dieter W. Fellner; Torsten Ullrich

doi:10.1007/978-3-662-61364-1_3

Distance Measurements of CAD Models in Boundary Representation

Ulrich Krispel^*, Dieter W. Fellner, Torsten Ullrich

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case significantly. Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. To illustrate the usage, we investigated and evaluated a grid-based distance measurement algorithm.

Original language	English
Title of host publication	Transactions on Computational Science XXXVI
Editors	M. Gavrilova, C. Tan, A. Sourin
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	43-63
Number of pages	21
ISBN (Print)	978-3-662-61363-4
DOIs	https://doi.org/10.1007/978-3-662-61364-1_3
Publication status	Published - 1 Jan 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12060 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Benchmark
Computational geometry
Computer-aided design
Euclidean distance

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Fields of Expertise

Information, Communication & Computing

Access to Document

10.1007/978-3-662-61364-1_3

Cite this

Krispel, U., Fellner, D. W., & Ullrich, T. (2020). Distance Measurements of CAD Models in Boundary Representation. In M. Gavrilova, C. Tan, & A. Sourin (Eds.), Transactions on Computational Science XXXVI (pp. 43-63). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12060 LNCS). Springer. https://doi.org/10.1007/978-3-662-61364-1_3

Distance Measurements of CAD Models in Boundary Representation. / Krispel, Ulrich ; Fellner, Dieter W.; Ullrich, Torsten.
Transactions on Computational Science XXXVI. ed. / M. Gavrilova; C. Tan; A. Sourin. Berlin, Heidelberg: Springer, 2020. p. 43-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12060 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Krispel, U , Fellner, DW & Ullrich, T 2020, Distance Measurements of CAD Models in Boundary Representation. in M Gavrilova, C Tan & A Sourin (eds), Transactions on Computational Science XXXVI. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12060 LNCS, Springer, Berlin, Heidelberg, pp. 43-63. https://doi.org/10.1007/978-3-662-61364-1_3

Krispel U , Fellner DW , Ullrich T. Distance Measurements of CAD Models in Boundary Representation. In Gavrilova M, Tan C, Sourin A, editors, Transactions on Computational Science XXXVI. Berlin, Heidelberg: Springer. 2020. p. 43-63. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-61364-1_3

Krispel, Ulrich ; Fellner, Dieter W. ; Ullrich, Torsten. / Distance Measurements of CAD Models in Boundary Representation. Transactions on Computational Science XXXVI. editor / M. Gavrilova ; C. Tan ; A. Sourin. Berlin, Heidelberg : Springer, 2020. pp. 43-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{77ddedd76491494b86cad3ec486534d0,

title = "Distance Measurements of CAD Models in Boundary Representation",

abstract = "The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case significantly. Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. To illustrate the usage, we investigated and evaluated a grid-based distance measurement algorithm.",

keywords = "Benchmark, Computational geometry, Computer-aided design, Euclidean distance",

author = "Ulrich Krispel and Fellner, {Dieter W.} and Torsten Ullrich",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-662-61364-1_3",

language = "English",

isbn = "978-3-662-61363-4",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "43--63",

editor = "M. Gavrilova and Tan, { C.} and A. Sourin",

booktitle = "Transactions on Computational Science XXXVI",

}

TY - CHAP

T1 - Distance Measurements of CAD Models in Boundary Representation

AU - Krispel, Ulrich

AU - Fellner, Dieter W.

AU - Ullrich, Torsten

PY - 2020/1/1

Y1 - 2020/1/1

N2 - The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case significantly. Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. To illustrate the usage, we investigated and evaluated a grid-based distance measurement algorithm.

AB - The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case significantly. Our contribution to this problem is a publicly available benchmark to compare distance calculation algorithms. To illustrate the usage, we investigated and evaluated a grid-based distance measurement algorithm.

KW - Benchmark

KW - Computational geometry

KW - Computer-aided design

KW - Euclidean distance

UR - http://www.scopus.com/inward/record.url?scp=85083440463&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-61364-1_3

DO - 10.1007/978-3-662-61364-1_3

M3 - Chapter

AN - SCOPUS:85083440463

SN - 978-3-662-61363-4

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 43

EP - 63

BT - Transactions on Computational Science XXXVI

A2 - Gavrilova, M.

A2 - Tan, C.

A2 - Sourin, A.

PB - Springer

CY - Berlin, Heidelberg

ER -

Distance Measurements of CAD Models in Boundary Representation

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Fields of Expertise

Access to Document

Other files and links

Fingerprint

Cite this