Sökning: onr:"swepub:oai:DiVA.org:hig-15219" >
Shortest diagonal t...
Shortest diagonal triangulation of convex layers
-
- Hast, Anders (författare)
- Uppsala universitet
-
- Jenke, Peter (författare)
- Högskolan i Gävle,Datavetenskap
-
- Seipel, Stefan (författare)
- Högskolan i Gävle,Datavetenskap,Uppsala universitet
-
(creator_code:org_t)
- 2013
- 2013
- Engelska.
-
Ingår i: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013. ; , s. 424-430
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.2...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Computational geometry; Constrained delaunay; Convex layers; Rotating caliper; Shortest diagonal; Triangulation
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)