hig.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Shortest diagonal triangulation of convex layers
Uppsala universitet.
University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science. Uppsala universitet.ORCID iD: 0000-0003-0085-5829
2013 (English)In: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, 2013, p. 424-430Conference paper, Published paper (Refereed)
Abstract [en]

One problem in the field of computational geometry is the triangulation of convex layers. The rotating caliper algorithm is an alternative to the constrained Delaunay triangulation method. We present an improved triangulation algorithm, which gives a mesh quality close to that of the Constrained Delaunay but substantially faster. Each layer will be connected to the neighboring layer by edges and from the two vertices constituting an edge the proposed algorithm will select the shortest diagonal to its next neighbors in the polygonal chain on the other side, i.e. from the outer layer to the inner layer or vice versa. We discuss quality issues regarding the rotating caliper method and some improvements to it, as well as how a Constrained Delaunay can be efficiently implemented for convex layers.

Place, publisher, year, edition, pages
2013. p. 424-430
Keywords [en]
Computational geometry; Constrained delaunay; Convex layers; Rotating caliper; Shortest diagonal; Triangulation
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hig:diva-15219DOI: 10.2316/P.2013.798-101Scopus ID: 2-s2.0-84876519357OAI: oai:DiVA.org:hig-15219DiVA, id: diva2:647972
Conference
IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, February 12 – 14, 2013, Innsbruck, Austria
Available from: 2013-09-13 Created: 2013-09-13 Last updated: 2018-03-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Hast, AndersJenke, PeterSeipel, Stefan

Search in DiVA

By author/editor
Hast, AndersJenke, PeterSeipel, Stefan
By organisation
Computer science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 230 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf