Results 1  10
of
838
A Condition Number Analysis of a SurfaceSurface Intersection Algorithm ∗
, 2008
"... The problem of finding all intersections between two surfaces has many applications in computational geometry and computeraided geometric design. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm uses a test based on the Kantorovich theorem to prevent ..."
Abstract
 Add to MetaCart
The problem of finding all intersections between two surfaces has many applications in computational geometry and computeraided geometric design. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm uses a test based on the Kantorovich theorem to prevent
A finitevolume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.
 J. Geophys. Res.,
, 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract

Cited by 293 (32 self)
 Add to MetaCart
is used which is solved as a Poisson equation for the pressure field with Neumann boundary conditions in a geometry as complicated as that of the ocean basins. A major objective of the study is to make this inversion, and hence nonhydrostatic ocean modeling, efficient on parallel computers. The pressure
An efficient surface intersection algorithm based on the lower dimensional formulation
 ACM TRANSACTIONS ON GRAPHICS
, 1997
"... We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algebraic formulation. In particular, we propose a matrix representation for the intersection curve and compute it accurately using matrix c ..."
Abstract

Cited by 72 (18 self)
 Add to MetaCart
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algebraic formulation. In particular, we propose a matrix representation for the intersection curve and compute it accurately using matrix
Inverse Global Illumination: Recovering Reflectance Models of Real Scenes from Photographs
, 1999
"... In this paper we present a method for recovering the reflectance properties of all surfaces in a real scene from a sparse set of photographs, taking into account both direct and indirect illumination. The result is a lightingindependent model of the scene's geometry and reflectance properties, ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
In this paper we present a method for recovering the reflectance properties of all surfaces in a real scene from a sparse set of photographs, taking into account both direct and indirect illumination. The result is a lightingindependent model of the scene's geometry and reflectance properties
Marching Intersections: an Efficient Resampling Algorithm for Surface Management
 In Proceedings of Shape Modeling International (SMI
, 2001
"... The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called Marching Intersections (MI), adopts a volumetric approach and acts as a resampling filter: all the intersection points between t ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called Marching Intersections (MI), adopts a volumetric approach and acts as a resampling filter: all the intersection points between
Feature Sensitive Surface Extraction from Volume Data
"... The representation of geometric objects based on volumetric data structures has advantages in many geometry processing applications that require, e.g., fast surface interrogation or boolean operations such as intersection and union. However, surface based algorithms like shape optimization (fairing) ..."
Abstract

Cited by 153 (10 self)
 Add to MetaCart
The representation of geometric objects based on volumetric data structures has advantages in many geometry processing applications that require, e.g., fast surface interrogation or boolean operations such as intersection and union. However, surface based algorithms like shape optimization (fairing
The Intersection of Two Ruled Surfaces
 ComputerAided Design
, 1999
"... This paper presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zeroset finding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. E ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zeroset finding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane
Focal Surfaces of Discrete Geometry
, 2007
"... The differential geometry of smooth threedimensional surfaces can be interpreted from one of two perspectives: in terms of oriented frames located on the surface, or in terms of a pair of associated focal surfaces. These focal surfaces are swept by the loci of the principal curvatures’ radii. In th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
slits, which are parallel to the specified parametrization planes and rule the focal surfaces. We develop both CPU and GPUbased algorithms to efficiently approximate these two slits and, hence, the focal meshes. Our focal mesh estimation also provides a novel discrete shape operator that simultaneously
Efficiently combining positions and normals for precise 3d geometry
 ACM Transactions on Graphics (Proc. SIGGRAPH
, 2005
"... not use color information in order to focus on geometric aspects. Note how our method eliminates noise from the range image while introducing real detail. The surface normals are of the same quality or better than those from photometric stereo, while most of the lowfrequency bias has been eliminate ..."
Abstract

Cited by 131 (9 self)
 Add to MetaCart
eliminated. Range scanning, manual 3D editing, and other modeling approaches can provide information about the geometry of surfaces in the form of either 3D positions (e.g., triangle meshes or range images) or orientations (normal maps or bump maps). We present an algorithm that combines these two kinds
Intersection Curves
"... Quadric surfaces occur frequently in the design of discrete piece parts in mechanical CAD/CAM. Solid modeling systems based on quadric surfaces must be able to represent intersection curves parametrically and in a fashion that allows the underlying surfaces to be partitioned. An algebraic approach o ..."
Abstract
 Add to MetaCart
Descriptors: G.4 [Mathematics of Computing]: Mathematical Softwareefficiency; reliability and robustness; 1.3.5 [Computer Graphics]: Computational Geometry and Object Modelingcurve, surface, solid, and object representations; geometric algorithms, languages,
Results 1  10
of
838