Results 1  10
of
17,514
Automatic reconstruction of Bspline surfaces of arbitrary topological type
 SIGGRAPH'96
, 1996
"... Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition—the 3D scanning of existing objects or clay maquettes. The problem of converting the dense point sets produced by laser scanners in ..."
Abstract

Cited by 173 (0 self)
 Add to MetaCart
is to directly reconstruct a surface of arbitrary topological type. We must therefore define the surface as a network of Bspline patches. A key ingredient in our solution is a scheme for automatically constructing both a network of patches and a parametrization of the data points over these patches. In addition
EXISTENCE OF PROPER MINIMAL SURFACES OF ARBITRARY TOPOLOGICAL TYPE
, 2009
"... Consider a domain D in R³ which is convex (possibly all R³) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f: M → D. Moreover, if D is smooth and bounded, then we prove that the immersion f: M → D can be chosen so that the li ..."
Abstract
 Add to MetaCart
Consider a domain D in R³ which is convex (possibly all R³) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f: M → D. Moreover, if D is smooth and bounded, then we prove that the immersion f: M → D can be chosen so that the limit sets of distinct ends of M are disjoint connected compact sets in ∂D.
VertexBased Delaunay Triangulation Of Meshes Of Arbitrary Topological Type
, 1997
"... Introduction Triangular meshes have become a standard way of representing objects in computer graphics and geometric modeling. Unfortunately, highly complex triangular meshes, easily generated by laser scanning systems, can be both frustrating to edit and expensive to store, transmit, and render. Mu ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Introduction Triangular meshes have become a standard way of representing objects in computer graphics and geometric modeling. Unfortunately, highly complex triangular meshes, easily generated by laser scanning systems, can be both frustrating to edit and expensive to store, transmit, and render. Multiresolution representations of meshes, developed by Lounsbery et al. [3, 4] and extended by others [2, 5], address these problems. A multiresolution representation of a mesh consists of a simple base mesh plus a series of local correction terms, wavelet coefficients, that capture the represented object's detail at increasing levels of resolution. Multiresolution mesh representations are therefore useful for applications such as compression and the progressive display and transmission of threedimensional graphics [2]. The one noted drawback to the Lounsbery et al. multiresolution analysis is that this method can only be applied to meshes displaying s
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be also used for more general HamiltonJacobitype problems. We demonstrate our algorithms
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Surface Simplification Using Quadric Error Metrics
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract

Cited by 1174 (16 self)
 Add to MetaCart
simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm
Approximation by Superpositions of a Sigmoidal Function
, 1989
"... In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube; only mild conditions are imposed on the univariate fun ..."
Abstract

Cited by 1248 (2 self)
 Add to MetaCart
function. Our results settle an open question about representability in the class of single bidden layer neural networks. In particular, we show that arbitrary decision regions can be arbitrarily well approximated by continuous feedforward neural networks with only a single internal, hidden layer and any
Mobility increases the capacity of adhoc wireless networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the persession throughpu ..."
Abstract

Cited by 1220 (5 self)
 Add to MetaCart
session throughput for applications with loose delay constraints, such that the topology changes over the timescale of packet delivery. Under this assumption, the peruser throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
, the performance of a singleserver GPS system is analyzed exactly from the standpoint of worstcase packet delay and burstiness when the sources are constrained by leaky buckets. The worstcase session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
Results 1  10
of
17,514