Results 1  10
of
229
Methodology and Techniques
"... In this paper we derive an equation for the velocity of an arbitrary timeevolving implicit surface. Strictly speaking only the normal component of the velocity is unambiguously defined. This is because an implicit surface does not have a unique parametrization. However, by enforcing a constraint on ..."
Abstract
 Add to MetaCart
In this paper we derive an equation for the velocity of an arbitrary timeevolving implicit surface. Strictly speaking only the normal component of the velocity is unambiguously defined. This is because an implicit surface does not have a unique parametrization. However, by enforcing a constraint
Geometry images
 IN PROC. 29TH SIGGRAPH
, 2002
"... Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create onl ..."
Abstract

Cited by 342 (24 self)
 Add to MetaCart
simple 2D array of quantized points. Surface signals like normals and colors are stored in similar 2D arrays using the same implicit surface parametrization — texture coordinates are absent. To create a geometry image, we cut an arbitrary mesh along a network of edge paths, and parametrize the resulting
KinectFusion: RealTime Dense Surface Mapping and Tracking
"... We present a system for accurate realtime mapping of complex and arbitrary indoor scenes in variable lighting conditions, using only a moving lowcost depth camera and commodity graphics hardware. We fuse all of the depth data streamed from a Kinect sensor into a single global implicit surface mo ..."
Abstract

Cited by 280 (25 self)
 Add to MetaCart
We present a system for accurate realtime mapping of complex and arbitrary indoor scenes in variable lighting conditions, using only a moving lowcost depth camera and commodity graphics hardware. We fuse all of the depth data streamed from a Kinect sensor into a single global implicit surface
Variational Implicit Surfaces
, 1999
"... We introduce a new method of creating smooth implicit surfaces of arbitrary manifold topology. These surfaces are described by specifying locations in 3D through which the surface should pass, and also identifying locations that are interior or exterior to the surface. A 3D implicit function is crea ..."
Abstract

Cited by 62 (2 self)
 Add to MetaCart
We introduce a new method of creating smooth implicit surfaces of arbitrary manifold topology. These surfaces are described by specifying locations in 3D through which the surface should pass, and also identifying locations that are interior or exterior to the surface. A 3D implicit function
Interpolating Implicit Surfaces From Scattered Surface Data Using Compactly Supported Radial Basis Functions
, 2001
"... We describe algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sam ..."
Abstract

Cited by 108 (4 self)
 Add to MetaCart
We describe algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete
Smooth Surface Reconstruction via Natural Neighbour Interpolation of Distance Functions
, 2000
"... We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and allows to deal with non uniform samples. The reconstructed surface is a smooth manifold passing through ..."
Abstract

Cited by 143 (8 self)
 Add to MetaCart
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and allows to deal with non uniform samples. The reconstructed surface is a smooth manifold passing
Fast Ray Tracing of Arbitrary Implicit Surfaces with Interval and Affine Arithmetic
"... Existing techniques for rendering arbitraryform implicit surfaces are limited, either in performance, correctness or flexibility. Ray tracing algorithms employing interval arithmetic (IA) or affine arithmetic (AA) for rootfinding are robust and general in the class of surfaces they support, but tr ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Existing techniques for rendering arbitraryform implicit surfaces are limited, either in performance, correctness or flexibility. Ray tracing algorithms employing interval arithmetic (IA) or affine arithmetic (AA) for rootfinding are robust and general in the class of surfaces they support
Beyond Lambert: Reconstructing surfaces with arbitrary BRDFs
 In Proceedings of IEEE international conference on computer vision
, 2001
"... We address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance distribution functions (BRDFs). Present reconstruction techniques, whether stereo vision, structure from motion, laser ra ..."
Abstract

Cited by 53 (5 self)
 Add to MetaCart
We address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance distribution functions (BRDFs). Present reconstruction techniques, whether stereo vision, structure from motion, laser
Interactive ray tracing of arbitrary implicits with simd interval arithmetic
 In Proceedings of the 2nd IEEE/EG Symposium on Interactive Ray Tracing
, 2007
"... We present a practical and efficient algorithm for interactively ray tracing arbitrary implicit surfaces. We use interval arithmetic (IA) both for robust root computation and guaranteed detection of topological features. In conjunction with ray tracing, this allows for rendering literally any progra ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
We present a practical and efficient algorithm for interactively ray tracing arbitrary implicit surfaces. We use interval arithmetic (IA) both for robust root computation and guaranteed detection of topological features. In conjunction with ray tracing, this allows for rendering literally any
Implicit Surface Patches
, 1997
"... Contents 1 Introduction 2 2 Mathematical Preliminaries 2 3 Curvlinear Mesh Scheme 5 4 Simplex and Box Based Schemes 7 4.1 Smooth Interpolation of a Polyhedron with C 1 Apatches : : : : : : : : : : : : : : : : : 7 4.2 Smooth Interpolation with C 2 Apatches : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
patches : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 4.3 Smooth Reconstruction of Surfaces and FunctionsonSurfaces from Scattered Data : : : 12 5 Subdivision Based Schemes 15 6 Conclusion 20 B1: APatches 2 1 Introduction While it is possible to model a general closed surface of arbitrary genus as a single implicit surface patch, the geometry
Results 1  10
of
229