Sciweavers

1419 search results - page 42 / 284
» A Characterization of Constructive Dimension
Sort
View
COMPGEOM
2003
ACM
15 years 5 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
TSP
2008
69views more  TSP 2008»
14 years 11 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
SIAMNUM
2011
117views more  SIAMNUM 2011»
14 years 6 months ago
Construction and Convergence Study of Schemes Preserving the Elliptic Local Maximum Principle
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Jérôme Droniou, Christophe Le Potier
DIMACS
2001
15 years 1 months ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald
TVCG
2012
184views Hardware» more  TVCG 2012»
13 years 2 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan