691 search results - page 5 / 139 » Axiomatizing geometric constructions |
81
Voted
SMA
2005
ACM
15 years 3 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...
77
Voted
COMGEO
2004
ACM
14 years 10 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
14 years 10 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...
89
Voted
GMP
2010
IEEE
15 years 1 months 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...
75
Voted
FOCS
2009
IEEE
15 years 5 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