Generalized Image Acquisition and Analysis

Intrinsic Shape Matching by Planned Landmark Sampling

Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have been particularly successful due to their generality and efficiency. We introduce a new sampling-based shape matching algorithm that uses a planning step to find optimized "landmark" points. These points are matched first in order to maximize the information gained and thus minimize the sampling costs. Our approach makes three main contributions: First, the new technique leads to a significant improvement in performance, which we demonstrate on a number of benchmark scenarios. Second, our technique does not require any keypoint detection. This is often a significant limitation for models that do not show sufficient surface features. Third, we examine the actual numerical degrees of freedom of the matching problem for a given piece of geometry. In contrast to previous results, our estimates take into account unprecise geodesics and potentially numerically unfavorable geometry of general topology, giving a more realistic complexity estimate.

Projects

Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering

Art Tevs, Ivo Ihrke, Hans-Peter Seidel
In: Proceedings of I3D 2008.



Abstract

This paper presents a GPU-based, fast, and accurate dynamic height field rendering technique that scales well to large scale height fields. Current real-time rendering algorithms for dynamic height fields employ approximate ray-height field intersection methods, whereas accurate algorithms require pre-computation in the order of seconds to minutes and are thus not suitable for dynamic height field rendering. We alleviate this problem by using maximum mipmaps, a hierarchical data structure supporting accurate and efficient rendering while simultaneously lowering the pre-computation costs to negligible levels. Furthermore, maximum mipmaps allow for view-dependent level-of-detail rendering. In combination with hierarchical ray-stepping this results in an efficient intersection algorithm for large scale height fields.
Project Page Video Slides

Bibtex

@inproceedings{Tevs08:MMM,
author = {Art Tevs and Ivo Ihrke and Hans-Peter Seidel},
title = {Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering},
booktitle = {Symposium on Interactive 3D Graphics and Games (i3D'08)},
year = 2008,
pages = {183--190},
}
Go to project list