hig.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Jenke, Peter
Publications (3 of 3) Show all publications
Hast, A., Jenke, P. & Seipel, S. (2013). Shortest diagonal triangulation of convex layers. In: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013: . Paper presented at IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, February 12 – 14, 2013, Innsbruck, Austria (pp. 424-430).
Open this publication in new window or tab >>Shortest diagonal triangulation of convex layers
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.

Keywords
Computational geometry; Constrained delaunay; Convex layers; Rotating caliper; Shortest diagonal; Triangulation
National Category
Computer Sciences
Identifiers
urn:nbn:se:hig:diva-15219 (URN)10.2316/P.2013.798-101 (DOI)2-s2.0-84876519357 (Scopus ID)
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
Seipel, S. & Jenke, P. (2011). Quantification of gaseous structures with volumetric reconstruction from visual hulls. In: Proceedings of SIGRAD 2011. Evaluations of Graphics and Visualization, November 17–18, 2011, KTH, Stockholm, Sweden. Paper presented at SIGRAD 2011, November 17–18, 2011, KTH, Stockholm, Sweden (pp. 77-82).
Open this publication in new window or tab >>Quantification of gaseous structures with volumetric reconstruction from visual hulls
2011 (English)In: Proceedings of SIGRAD 2011. Evaluations of Graphics and Visualization, November 17–18, 2011, KTH, Stockholm, Sweden, 2011, p. 77-82Conference paper, Published paper (Refereed)
Abstract [en]

3D reconstruction from visual hulls is a well established technique for camera based reconstruction of 3D objects in computer graphics. We propose in this paper to employ visual hull techniques to quantify the volume of diffusely defined gaseous structures. In our evaluation, visual quality of the 3D reconstructions is secondary. Instead, using synthetic ground truth data, we determine the number of independent silhouette images needed to achieve a stable volume estimate. We also estimate the influence of different segmentation results of the silhouette images on final volume estimates. Our results show that comparably few camera views yield to convergent volume estimates. For the type of 3D data studied, visual hull reconstructions overestimate actual volumes with about 50%. This proportion seems to be consistent for different data sets tested and may serve for re-calibration of volume estimation of gaseous structures.

National Category
Computer Engineering
Identifiers
urn:nbn:se:hig:diva-12948 (URN)
Conference
SIGRAD 2011, November 17–18, 2011, KTH, Stockholm, Sweden
Available from: 2012-09-18 Created: 2012-09-18 Last updated: 2018-03-13Bibliographically approved
Jenke, P., Hast, A. & Seipel, S. (2010). On the quality of point-cloud triangulations based on convex hulls. In: Proceedings of the Annual SIGRAD Conference 2010. Paper presented at SIGRAD Conference 2010, November 25-26, Västerås, Sweden (pp. 71-76).
Open this publication in new window or tab >>On the quality of point-cloud triangulations based on convex hulls
2010 (English)In: Proceedings of the Annual SIGRAD Conference 2010, 2010, p. 71-76Conference paper, Published paper (Refereed)
National Category
Computer Sciences
Identifiers
urn:nbn:se:hig:diva-12949 (URN)
Conference
SIGRAD Conference 2010, November 25-26, Västerås, Sweden
Available from: 2012-09-18 Created: 2012-09-18 Last updated: 2018-03-13Bibliographically approved
Organisations

Search in DiVA

Show all publications