Sciweavers

1387 search results - page 15 / 278
» Convexity in Discrete Space
Sort
View
SIAMNUM
2010
96views more  SIAMNUM 2010»
13 years 2 months ago
On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Problems
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
Wolfgang Boiger, Carsten Carstensen
TROB
2002
138views more  TROB 2002»
13 years 7 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
COMPGEOM
2004
ACM
14 years 28 days ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
COMPGEOM
2007
ACM
13 years 11 months ago
Querying approximate shortest paths in anisotropic regions
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
DGCI
2009
Springer
13 years 10 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud