Results 1  10
of
1,038
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
, to accommodate different types of constraints. Some constraints can be imposed without any modification of the algorithm, while others require the solution of a small associated linear system of equations. In particular, vertex location constraints, vertex normal constraints, and surface normal discontinuities
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
surface from scattered sample points arises in many applications such as computer graphics, medical imaging, and cartography. In this paper we consider the specific reconstruction problem in which the input is a set of sample points S drawn from a smooth twodimensional manifold F embedded in three
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
The filter cache: An energy efficient memory structure
 In Proceedings of the 1997 International Symposium on Microarchitecture
, 1997
"... Most modern microprocessors employ one or two levels of onchip caches in order to improve performance. These caches are typically implemented with static RAM cells and often occupy a large portion of the chip area. Not surprisingly, these caches often consume a significant amount of power. In many ..."
Abstract

Cited by 222 (4 self)
 Add to MetaCart
applications, such as portable devices, low power is more important than performance. We propose to trade performance for power consumption by filtering cache references through an unusually small L1 cache. An L2 cache, which is similar in size and structure to a typical L1 cache, is positioned behind
The topology of normal singularities of an algebraic surface and a criterion for simplicity
 HAUTES ÉTUDES SCI. PUBL. MATH
"... Let a variety Vn be embedded in complex projective space of dimension m. Let PEV. About P, choose a ball U of small radius E, in some affine metric ds2 = = ~dx; + ~dy;, Zj = = xj + £1 \ affine coordinates. Let B be its boundary and M = = Bn V. Then M is a real complex of dimension 2n I, and a manif ..."
Abstract

Cited by 149 (1 self)
 Add to MetaCart
Let a variety Vn be embedded in complex projective space of dimension m. Let PEV. About P, choose a ball U of small radius E, in some affine metric ds2 = = ~dx; + ~dy;, Zj = = xj + £1 \ affine coordinates. Let B be its boundary and M = = Bn V. Then M is a real complex of dimension 2n I, and a
Metamorphosis of Arbitrary Triangular Meshes
 ABSTRACT TO APPEAR IN IEEE COMPUTER GRAPHICS AND APPLICATIONS
"... Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of threedimensional objects is one of the techniques which realizes shape transformation between two or more existing objects. In this paper, we present an ef ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
an efficient framework for metamorphosis between two topologically equivalent, arbitrary meshes with the control of surface correspondences by the user. The basic idea of our method is to partition meshes according to the reference shapes specified by the user, whereby vertextovertex correspondences between
Salient geometric features for partial shape matching and similarity
 jTOG
"... This article introduces a method for partial matching of surfaces represented by triangular meshes. Our method matches surface regions that are numerically and topologically dissimilar, but approximately similar regions. We introduce novel local surface descriptors which efficiently represent the ge ..."
Abstract

Cited by 148 (4 self)
 Add to MetaCart
This article introduces a method for partial matching of surfaces represented by triangular meshes. Our method matches surface regions that are numerically and topologically dissimilar, but approximately similar regions. We introduce novel local surface descriptors which efficiently represent
Surface matching via currents
 IPMI 2005. LNCS
, 2005
"... Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3dimensional space. Our main contribution is in building a norm on the space of surfaces via representation by currents of geometric measure theory. Currents are an appropriat ..."
Abstract

Cited by 105 (2 self)
 Add to MetaCart
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3dimensional space. Our main contribution is in building a norm on the space of surfaces via representation by currents of geometric measure theory. Currents
Divisors of small genus on algebraic surfaces and projective embeddings
 Proceedings of the conference \Hirzebruch 65", Tel Aviv 1993, Contemp. Math., A.M.S. (1994), subseries `Israel Mathematical Conference Proceedings
, 1996
"... Abstract. In this article we give a numerical criterion, valid in all characteristics, for the very ampleness of a line bundle H on a curve C (possibly reducible and non reduced) lying on a smooth algebraic surface. We show by the way that this criterion essentially implies the results of Bombieri a ..."
Abstract

Cited by 24 (11 self)
 Add to MetaCart
and Ekedahl on pluricanonical embeddings of surfaces of general type. We use our numerical criterion to obtain the ne classication of non special rational surfaces in P 4 (with one exception dealt with in a forthcoming article). We also describe in full detail the embeddings when C is a curve of genus 2 and H
Ray shooting and parametric search
, 1993
"... Efficient algorithms for the ray shooting problem are presented: Given a collection F of objects in d, build a data structure so that, for a query ray, the first object of F hit by the ray can be quickly determined. Using the parametric search technique, this problem is reduced to the segment emptin ..."
Abstract

Cited by 126 (22 self)
 Add to MetaCart
emptiness problem. For various ray shooting problems, space/querytime tradeoffs of the following type are achieved: For some integer b and a parameter m (n _< m < n b) the queries are answered in time O((n/m /b) log <) n), with O(m!+) space and preprocessing time (t> 0 is arbitrarily small
Results 1  10
of
1,038