hig.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Shortest diagonal triangulation of convex layers
Uppsala universitet.
Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap. Uppsala universitet.ORCID-id: 0000-0003-0085-5829
2013 (engelsk)Inngår i: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, 2013, s. 424-430Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
2013. s. 424-430
Emneord [en]
Computational geometry; Constrained delaunay; Convex layers; Rotating caliper; Shortest diagonal; Triangulation
HSV kategori
Identifikatorer
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
Konferanse
IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, February 12 – 14, 2013, Innsbruck, Austria
Tilgjengelig fra: 2013-09-13 Laget: 2013-09-13 Sist oppdatert: 2018-03-13bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Hast, AndersJenke, PeterSeipel, Stefan

Søk i DiVA

Av forfatter/redaktør
Hast, AndersJenke, PeterSeipel, Stefan
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 235 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf