hig.sePublications
Change search
Refine search result
1 - 3 of 3
CiteExportLink to result list
Permanent 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Hast, Anders
    et al.
    Uppsala universitet.
    Jenke, Peter
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    Seipel, Stefan
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science. Uppsala universitet.
    Shortest diagonal triangulation of convex layers2013In: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, 2013, p. 424-430Conference 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.

  • 2.
    Jenke, Peter
    et al.
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    Hast, Anders
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    Seipel, Stefan
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    On the quality of point-cloud triangulations based on convex hulls2010In: Proceedings of the Annual SIGRAD Conference 2010, 2010, p. 71-76Conference paper (Refereed)
  • 3.
    Seipel, Stefan
    et al.
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    Jenke, Peter
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management, Computer science.
    Quantification of gaseous structures with volumetric reconstruction from visual hulls2011In: Proceedings of SIGRAD 2011. Evaluations of Graphics and Visualization, November 17–18, 2011, KTH, Stockholm, Sweden, 2011, p. 77-82Conference 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.

1 - 3 of 3
CiteExportLink to result list
Permanent 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