Results 1  10
of
1,605
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 815 (8 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed
Routing in a Delay Tolerant Network
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
that no contemporaneous endtoend path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing endtoend path. We propose a framework for evaluating routing algorithms in such environments. We then develop several
Shape modeling with front propagation: A level set approach
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1995
"... Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and over ..."
Abstract

Cited by 808 (20 self)
 Add to MetaCart
comes some of their limitations. Our techniques can be applied to model arbitrarily complex shapes, which include shapes with significant protrusions, and to situations where no a priori assumption about the object’s topology is made. A single instance of our model, when presented with an image having more
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract

Cited by 493 (7 self)
 Add to MetaCart
of the original file) and, also, to schemes in which only the source is allowed to generate and transmit encoded packets. We study the performance of network coding in heterogeneous networks with dynamic node arrival and departure patterns, clustered topologies, and when incentive mechanisms to discourage free
A Growing Neural Gas Network Learns Topologies
 Advances in Neural Information Processing Systems 7
, 1995
"... An incremental network model is introduced which is able to learn the important topological relations in a given set of input vectors by means of a simple Hebblike learning rule. In contrast to previous approaches like the "neural gas" method of Martinetz and Schulten (1991, 1994), this m ..."
Abstract

Cited by 401 (5 self)
 Add to MetaCart
An incremental network model is introduced which is able to learn the important topological relations in a given set of input vectors by means of a simple Hebblike learning rule. In contrast to previous approaches like the "neural gas" method of Martinetz and Schulten (1991, 1994
Filling Holes In Complex Surfaces Using Volumetric Diffusion
, 2001
"... We address the problem of building watertight 3D models from surfaces that contain holesfor example, sets of range scans that observe most but not all of a surface. We specifically address situations in which the holes are too geometrically and topologically complex to fill using triangulation al ..."
Abstract

Cited by 172 (2 self)
 Add to MetaCart
We address the problem of building watertight 3D models from surfaces that contain holesfor example, sets of range scans that observe most but not all of a surface. We specifically address situations in which the holes are too geometrically and topologically complex to fill using triangulation
Visualizing Nonlinear Vector Field Topology
 IEEE TVCG
, 1999
"... Abstract — We present our results on the visualization of nonlinear vector field topology. The underlying mathematics is done in Clifford algebra, a system describing geometry by extending the usual vector space by a multiplication of vectors. We started with the observation that all known algorith ..."
Abstract

Cited by 71 (9 self)
 Add to MetaCart
algorithms for vector field topology are based on piecewise linear or bilinear approximation and that these methods destroy the local topology if nonlinear behavior is present. Our algorithm looks for such situations, chooses an appropriate polynomial approximation in these areas and finally visualizes
Qualitative Spatial Reasoning with Topological Relations in the Situation Calculus
"... We use a qualitative theory of spatial change and illustrate some of the key representational aspects of specifying such a theory using a formalism to reason about action & change; an effort that we regard to be essential toward a general integration of qualitative spatial reasoning with reason ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
with reasoning about the dynamic, causal aspects of spatial change. A topological theory of space, namely the region connection calculus, is used as the spatial metaphor in this work; the reason here primarily being that topological distinctions are inherently qualitative in nature and also because a relational
Some Situations When the Topological phiCategory is Infinite
, 1995
"... . The topological 'category 'top (M;N) of a pair of manifolds (M;N) is introduced and studied in the authors' paper [3]. The main result of this present paper gives sufficient conditions in terms of fundamental groups of the compact manifolds M m ; N n (m n 2), in order that & ..."
Abstract
 Add to MetaCart
. The topological 'category 'top (M;N) of a pair of manifolds (M;N) is introduced and studied in the authors' paper [3]. The main result of this present paper gives sufficient conditions in terms of fundamental groups of the compact manifolds M m ; N n (m n 2), in order
Topologies on types
, 2004
"... We define and analyze a "strategic topology" on types in the HarsanyiMertensZamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
We define and analyze a "strategic topology" on types in the HarsanyiMertensZamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference
Results 1  10
of
1,605