1387 search results - page 20 / 278 » Convexity in Discrete Space |
130
Voted
CP
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
EUSFLAT
2007
15 years 3 months ago
2007
In this paper discrete quasi-copulas (defined on a square grid I2 n of [0,1]) are studied and it is proved that they can be represented by means of a special class of matrices wi...
132
click to vote
COMPGEOM
1996
ACM
15 years 6 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
113
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
105
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...