Construction of smooth branching surfaces using T-splines

A. I. Ginnis, K. V. Kostas, P. D. Kaklis

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The request for designing or reconstructing objects from planar cross sections arises in various applications, ranging from CAD to GIS and Medical Imaging. The present work focuses on the “one-to-many” branching problem, where one of the planes can be populated with many, possibly tortuous and densely packed, contours. The proposed method combines the proximity information offered by the Euclidean Voronoi diagram with the concept of surrounding curve, introduced in Gabrielides et al. (2007), and T-splines technology Sederberg et al. (2003) for securing a flexible and portable representation. Our algorithm delivers a single cubic T-spline that deviates from the given contours less than a user-specified tolerance, measured via the so-called discrete Fréchet distance Eiter and Mannila (1994) and is C2 everywhere except from a finite set of point-neighborhoods. Subject to minor enrichment, the algorithm is also capable to handle the “many-to-many” configuration as well as the global reconstruction problem involving contours on several planes.

Original languageEnglish
Pages (from-to)22-32
Number of pages11
JournalCAD Computer Aided Design
Volume92
DOIs
Publication statusPublished - Nov 1 2017

Fingerprint

Splines
Medical imaging
Geographic information systems
Computer aided design

Keywords

  • Branching surface
  • Discrete Fréchet distance
  • Surrounding curve
  • T-splines
  • Voronoi diagram

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering

Cite this

Construction of smooth branching surfaces using T-splines. / Ginnis, A. I.; Kostas, K. V.; Kaklis, P. D.

In: CAD Computer Aided Design, Vol. 92, 01.11.2017, p. 22-32.

Research output: Contribution to journalArticle

Ginnis, A. I. ; Kostas, K. V. ; Kaklis, P. D. / Construction of smooth branching surfaces using T-splines. In: CAD Computer Aided Design. 2017 ; Vol. 92. pp. 22-32.
@article{0918be26d01b4c9c9818d6decd16052c,
title = "Construction of smooth branching surfaces using T-splines",
abstract = "The request for designing or reconstructing objects from planar cross sections arises in various applications, ranging from CAD to GIS and Medical Imaging. The present work focuses on the “one-to-many” branching problem, where one of the planes can be populated with many, possibly tortuous and densely packed, contours. The proposed method combines the proximity information offered by the Euclidean Voronoi diagram with the concept of surrounding curve, introduced in Gabrielides et al. (2007), and T-splines technology Sederberg et al. (2003) for securing a flexible and portable representation. Our algorithm delivers a single cubic T-spline that deviates from the given contours less than a user-specified tolerance, measured via the so-called discrete Fr{\'e}chet distance Eiter and Mannila (1994) and is C2 everywhere except from a finite set of point-neighborhoods. Subject to minor enrichment, the algorithm is also capable to handle the “many-to-many” configuration as well as the global reconstruction problem involving contours on several planes.",
keywords = "Branching surface, Discrete Fr{\'e}chet distance, Surrounding curve, T-splines, Voronoi diagram",
author = "Ginnis, {A. I.} and Kostas, {K. V.} and Kaklis, {P. D.}",
year = "2017",
month = "11",
day = "1",
doi = "10.1016/j.cad.2017.06.001",
language = "English",
volume = "92",
pages = "22--32",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier",

}

TY - JOUR

T1 - Construction of smooth branching surfaces using T-splines

AU - Ginnis, A. I.

AU - Kostas, K. V.

AU - Kaklis, P. D.

PY - 2017/11/1

Y1 - 2017/11/1

N2 - The request for designing or reconstructing objects from planar cross sections arises in various applications, ranging from CAD to GIS and Medical Imaging. The present work focuses on the “one-to-many” branching problem, where one of the planes can be populated with many, possibly tortuous and densely packed, contours. The proposed method combines the proximity information offered by the Euclidean Voronoi diagram with the concept of surrounding curve, introduced in Gabrielides et al. (2007), and T-splines technology Sederberg et al. (2003) for securing a flexible and portable representation. Our algorithm delivers a single cubic T-spline that deviates from the given contours less than a user-specified tolerance, measured via the so-called discrete Fréchet distance Eiter and Mannila (1994) and is C2 everywhere except from a finite set of point-neighborhoods. Subject to minor enrichment, the algorithm is also capable to handle the “many-to-many” configuration as well as the global reconstruction problem involving contours on several planes.

AB - The request for designing or reconstructing objects from planar cross sections arises in various applications, ranging from CAD to GIS and Medical Imaging. The present work focuses on the “one-to-many” branching problem, where one of the planes can be populated with many, possibly tortuous and densely packed, contours. The proposed method combines the proximity information offered by the Euclidean Voronoi diagram with the concept of surrounding curve, introduced in Gabrielides et al. (2007), and T-splines technology Sederberg et al. (2003) for securing a flexible and portable representation. Our algorithm delivers a single cubic T-spline that deviates from the given contours less than a user-specified tolerance, measured via the so-called discrete Fréchet distance Eiter and Mannila (1994) and is C2 everywhere except from a finite set of point-neighborhoods. Subject to minor enrichment, the algorithm is also capable to handle the “many-to-many” configuration as well as the global reconstruction problem involving contours on several planes.

KW - Branching surface

KW - Discrete Fréchet distance

KW - Surrounding curve

KW - T-splines

KW - Voronoi diagram

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

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

U2 - 10.1016/j.cad.2017.06.001

DO - 10.1016/j.cad.2017.06.001

M3 - Article

VL - 92

SP - 22

EP - 32

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

ER -