Result 1 to 20 from 20 total
Voxelized Minkowski sum computation on the GPU with robust culling. (English)
Comput.-Aided Des. 43, No. 10, 1270-1283 (2011).
1
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. (English)
Comput.-Aided Des. 43, No. 10, 1258-1269 (2011).
2
On the exact maximum complexity of Minkowski sums of polytopes. (English)
Discrete Comput. Geom. 42, No. 4, 654-669 (2009).
3
Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently. (English)
Discrete Comput. Geom. 42, No. 1, 22-36 (2009).
4
Exact and approximate construction of offset polygons. (English)
Comput.-Aided Des. 39, No. 6, 518-527 (2007).
5
Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions. (English)
J. Comput. Appl. Math. 209, No. 2, 246-266 (2007).
6
Fast and Reliable Collision Culling Using Graphics Hardware. (English)
IEEE Transactions on Visualization and Computer Graphics 12, No.02, 143-154 (2006).
7
Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves. (English)
Numer. Algorithms 40, No. 3, 251-283 (2005).
8
An alternate proof of Cohn’s four squares theorem. (English)
J. Number Theory 104, No. 2, 263-278 (2004).
9
Enumerating a subset of the integer points inside a Minkowski sum. (English)
Comput. Geom. 22, No.1-3, 143-166 (2002).
10
Polygon decomposition for efficient construction of Minkowski sums. (English)
Comput. Geom. 21, No.1-2, 39-61 (2002).
11
Absolute irreducibility of polynomials via Newton polytopes. (English)
J. Algebra 237, No.2, 501-520 (2001).
12
Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions. (English)
Discrete Comput. Geom. 24, No.4, 645-685 (2000).
13
Algorithms for Minkowski products and implicitly-defined complex sets. (English)
Adv. Comput. Math. 13, No.3, 199-229 (2000).
14
Counterexamples to the connectivity conjecture of the mixed cells. (English)
Discrete Comput. Geom. 20, No.4, 515-521 (1998).
15
Combinatorial complexity of translating a box in polyhedral 3-space. (English)
Comput. Geom. 9, No.3, 181-196 (1998).
16
Polygonal objects metamorphose. (Métamorphose d’objets polyédriques.) (English)
RAIRO, Tech. Sci. Inf. 15, No. 3, 329-351 (1996).
17
Blob metamorphosis based on Minkowski sums. (English)
Comput. Graph. Forum 15, No. 3, 143-153 (1996).
18
Computing Minkowski sums of plane curves. (English)
Int. J. Comput. Geom. Appl. 5, No.4, 413-432 (1995).
19
Software for roundoff analysis of matrix algorithms. (English)
New York etc.: Academic Press (A Subsidiary of Harcourt Brace Jovanovich, Publishers), X, \$ 18.50, 151 p. (1980).
20
Result 1 to 20 from 20 total
Start
Contact
Print
General Help
