691 search results - page 5 / 139 » Axiomatizing geometric constructions |
SMA
2005
ACM
14 years 2 months ago
2005
ACM
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
COMBINATORICS
2004
13 years 8 months ago
2004
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
GMP
2010
IEEE
14 years 7 hour ago
2010
IEEE
In this paper, we present a method for constructing Loop’s subdivision surface patches with given G1 boundary conditions and a given topology of control polygon of the subdivisi...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith