4 Search Results for "Umlauf, Georg"


Document
A Hand-held Laser Scanner based on Multi-camera Stereo-matching

Authors: Christoph Bender, Klaus Denker, Markus Friedrich, Kai Hirt, and Georg Umlauf

Published in: OASIcs, Volume 27, Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011


Abstract
Most laser scanners in engineering are extended versions of tactile measuring machines. These high precision devices are typically very expensive and hardware modifications are not possible without impairing the precision of the device. For these reasons we built our own laser-scanner system. It is based on a multi-camera reconstruction system developed for fast 3D face reconstructions. Based on this camera system, we developed a laser-scanner using GPU accelerated stereo-matching techniques and a hand-held line-laser probe. The resulting reconstruction is solely based on the known camera positions and parameters. Thus, it is not necessary to track the position and movement of the line-laser probe. This yields an inexpensive laser-scanner system where every hardware component can be modified individually for experiments and future extensions of the system.

Cite as

Christoph Bender, Klaus Denker, Markus Friedrich, Kai Hirt, and Georg Umlauf. A Hand-held Laser Scanner based on Multi-camera Stereo-matching. In Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011. Open Access Series in Informatics (OASIcs), Volume 27, pp. 123-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


Copy BibTex To Clipboard

@InProceedings{bender_et_al:OASIcs.VLUDS.2011.123,
  author =	{Bender, Christoph and Denker, Klaus and Friedrich, Markus and Hirt, Kai and Umlauf, Georg},
  title =	{{A Hand-held Laser Scanner based on Multi-camera Stereo-matching}},
  booktitle =	{Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011},
  pages =	{123--133},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-46-0},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{27},
  editor =	{Garth, Christoph and Middel, Ariane and Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.VLUDS.2011.123},
  URN =		{urn:nbn:de:0030-drops-37461},
  doi =		{10.4230/OASIcs.VLUDS.2011.123},
  annote =	{Keywords: Laser scanner, 3D point clouds, stereo-matching, multi-camera}
}
Document
Finite Element Analysis for Linear Elastic Solids Based on Subdivision Schemes

Authors: Daniel Burkhart, Bernd Hamann, and Georg Umlauf

Published in: OASIcs, Volume 19, Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop) (2011)


Abstract
Finite element methods are used in various areas ranging from mechanical engineering to computer graphics and bio-medical applications. In engineering, a critical point is the gap between CAD and CAE. This gap results from different representations used for geometric design and physical simulation. We present two different approaches for using subdivision solids as the only representation for modeling, simulation and visualization. This has the advantage that no data must be converted between the CAD and CAE phases. The first approach is based on an adaptive and feature-preserving tetrahedral subdivision scheme. The second approach is based on Catmull-Clark subdivision solids.

Cite as

Daniel Burkhart, Bernd Hamann, and Georg Umlauf. Finite Element Analysis for Linear Elastic Solids Based on Subdivision Schemes. In Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop). Open Access Series in Informatics (OASIcs), Volume 19, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{burkhart_et_al:OASIcs.VLUDS.2010.1,
  author =	{Burkhart, Daniel and Hamann, Bernd and Umlauf, Georg},
  title =	{{Finite Element Analysis for Linear Elastic Solids Based on Subdivision Schemes}},
  booktitle =	{Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop)},
  pages =	{1--10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-29-3},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{19},
  editor =	{Middel, Ariane and Scheler, Inga and Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.VLUDS.2010.1},
  URN =		{urn:nbn:de:0030-drops-30928},
  doi =		{10.4230/OASIcs.VLUDS.2010.1},
  annote =	{Keywords: Subdivision solids, Finite element method, Isogeometric analysis}
}
Document
Survey on Benchmarks for a GPU Based Multi Camera Stereo Matching Algorithm

Authors: Klaus Denker and Georg Umlauf

Published in: OASIcs, Volume 19, Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop) (2011)


Abstract
Stereo matching algorithms and multi camera reconstruction algorithms are usually compared using benchmarks. These benchmarks compare the quality of the resulting depth map or reconstructed surface mesh. We describe the differences between several known stereo and multi-view stereo benchmarks and their various datasets. Also the modifications that are necessary to use our own GPU based multi camera stereo matching algorithm with the data from these benchmarks are discussed.

Cite as

Klaus Denker and Georg Umlauf. Survey on Benchmarks for a GPU Based Multi Camera Stereo Matching Algorithm. In Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop). Open Access Series in Informatics (OASIcs), Volume 19, pp. 20-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{denker_et_al:OASIcs.VLUDS.2010.20,
  author =	{Denker, Klaus and Umlauf, Georg},
  title =	{{Survey on Benchmarks for a GPU Based Multi Camera Stereo Matching Algorithm}},
  booktitle =	{Visualization of Large and Unstructured Data Sets - Applications in Geospatial Planning, Modeling and Engineering (IRTG 1131 Workshop)},
  pages =	{20--26},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-29-3},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{19},
  editor =	{Middel, Ariane and Scheler, Inga and Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.VLUDS.2010.20},
  URN =		{urn:nbn:de:0030-drops-30934},
  doi =		{10.4230/OASIcs.VLUDS.2010.20},
  annote =	{Keywords: Stereo matching, Multi camera, GPU}
}
Document
Generalized Swap Operation for Tetrahedrizations

Authors: Burkhard Lehner, Bernd Hamann, and Georg Umlauf

Published in: Dagstuhl Follow-Ups, Volume 1, Scientific Visualization: Advanced Concepts (2010)


Abstract
Mesh optimization of 2D and 3D triangulations is used in multiple applications extensively. For example, mesh optimization is crucial in the context of adaptively discretizing geometry, typically representing the geometrical boundary conditions of a numerical simulation, or adaptively discretizing the entire space over which various dependent variables of a numerical simulation must be approximated. Together with operations applied to the vertices the so-called edge or face swap operations are the building block of all optimization approaches. To speed up the optimization or to avoid local minima of the function measuring overall mesh quality these swaps are combined to generalized swap operations with a less local impact on the triangulation. Despite the fact that these swap operations change only the connectivity of a triangulation, it depends on the geometry of the triangulation whether the generalized swap will generate inconsistently oriented or degenerate simplices. Because these are undesirable for numerical reasons, this paper is concerned with geometric criteria that guarantee the generalized swaps for a 3D triangulation to yield only valid, non-degenerate triangulations.

Cite as

Burkhard Lehner, Bernd Hamann, and Georg Umlauf. Generalized Swap Operation for Tetrahedrizations. In Scientific Visualization: Advanced Concepts. Dagstuhl Follow-Ups, Volume 1, pp. 30-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InCollection{lehner_et_al:DFU.SciViz.2010.30,
  author =	{Lehner, Burkhard and Hamann, Bernd and Umlauf, Georg},
  title =	{{Generalized Swap Operation for Tetrahedrizations}},
  booktitle =	{Scientific Visualization: Advanced Concepts},
  pages =	{30--44},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-19-4},
  ISSN =	{1868-8977},
  year =	{2010},
  volume =	{1},
  editor =	{Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.SciViz.2010.30},
  URN =		{urn:nbn:de:0030-drops-26956},
  doi =		{10.4230/DFU.SciViz.2010.30},
  annote =	{Keywords: 3D Triangulation, Geometric Conditions, Swap Operations}
}
  • Refine by Author
  • 4 Umlauf, Georg
  • 2 Denker, Klaus
  • 2 Hamann, Bernd
  • 1 Bender, Christoph
  • 1 Burkhart, Daniel
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 3D Triangulation
  • 1 3D point clouds
  • 1 Finite element method
  • 1 GPU
  • 1 Geometric Conditions
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 2 2011
  • 1 2010
  • 1 2012

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail