Swen Campagna

Learn More
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major observation is that the hierarchy of nested spaces which is(More)
In a broad range of computer graphics applications the representation of geometric shape is based on triangle meshes. General purpose data structures for polygonal meshes typically provide fast access to geometric objects (e.g. points) and topologic entities (e.g. neighborhood relation) but the memory requirements are rather high due to the many special(More)
Ray tracing is a well-known rendering technique for producing high-quality and photorealistic pictures. Spline surfaces are also well known and widely used. Thus, there is the need for fast and robust methods for computing the intersections of rays with these surfaces. In this paper, we discuss and compare three recent geometric algorithms for solving the(More)
Due to their simplicity, triangle meshes are used to represent geometric objects in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware and the transmission time of such data is often inappropriately high, a large variety of mesh simplification algorithms has been proposed in the last years. In(More)
Parametric surfaces are a powerful and popular modeling tool in computer graphics and computer aided design, while ray tracing is a versatile and very popular rendering technique. As a result, there is a strong incentive in developing fast, accurate, and reliable algorithms for solving the ray-patch-intersection problem. In this paper, we discuss and(More)