Result 1 to 20 of 71 total
Non-commutative morphology: Shapes, filters, and convolutions. (English)
Comput. Aided Geom. Des. 28, No. 8, 497-522 (2011).
1
Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans. (English)
Comput.-Aided Des. 43, No. 12, 1567-1576 (2011).
2
A new calculation method for the worst case tolerance analysis and synthesis in stack-type assemblies. (English)
Comput.-Aided Des. 43, No. 9, 1118-1125 (2011).
3
Configuration products and quotients in geometric modeling. (English)
Comput.-Aided Des. 43, No. 7, 781-794 (2011).
4
Approximate convolution with pairs of cubic Bézier LN curves. (English)
Comput. Aided Geom. Des. 28, No. 6, 357-367 (2011).
5
Absolute irreducibility of bivariate polynomials via polytope method. (English)
J. Korean Math. Soc. 48, No. 5, 1065-1081 (2011).
6
Minkowski sum selection and finding. (English)
Int. J. Comput. Geom. Appl. 21, No. 3, 283-311 (2011).
7
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants. (English)
J. Symb. Comput. 46, No. 8, 919-942 (2011).
8
Discrete and computational geometry. (English)
Princeton, NJ: Princeton University Press (ISBN 978-0-691-14553-2/hbk; 978-1-400-83898-1/ebook). xi, 255~p. \$~49.50, \sterling~34.95/hbk; \$~49.50/ebook (2011).
9
A simple method for computing Minkowski sum boundary in 3D using collision detection. (English)
Chirikjian, Gregory S. (ed.) et al., Algorithmic foundations of robotics VIII. Selected contributions of the eighth international workshop on the algorithmic foundations of robotics (WAFR 2008), Guanajuato, México, December 7‒9, 2008. Berlin: Springer (ISBN 978-3-642-00311-0/hbk978-3-642-00312-7/ebook). Springer Tracts in Advanced Robotics 57, 401-415 (2010).
10
Optimized algorithms for predictive range and KNN queries on moving objects. (English)
Inf. Syst. 35, No. 8, 911-932 (2010).
11
Two approximate Minkowski sum algorithms. (English)
Int. J. Comput. Geom. Appl. 20, No. 4, 485-509 (2010).
12
Cephoids: Minkowski sums of de Gua simplexes. (English)
Optimization 59, No. 3-4, 515-540 (2010).
13
On Minkowski sums of simplices. (English)
Ann. Comb. 13, No. 3, 271-287 (2009).
14
Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums. (English)
Comput.-Aided Des. 41, No. 9, 668-680 (2009).
15
Contributing vertices-based Minkowski sum computation of convex polyhedra. (English)
Comput.-Aided Des. 41, No. 7, 525-538 (2009).
16
Toric surface codes and Minkowski length of polygons. (English)
SIAM J. Discrete Math. 23, No. 1, 384-400 (2009).
17
Reducing the time complexity and identifying ill-posed problem instances of Minkowski sum based similarity calculations. (English)
Int. J. Comput. Geom. Appl. 19, No. 5, 441-456 (2009).
18
Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces. (English)
Algorithmica 55, No. 2, 329-345 (2009).
19
Dynamic balancing of planar mechanisms using toric geometry. (English)
J. Symb. Comput. 44, No. 9, 1346-1358 (2009).
20
Result 1 to 20 of 71 total
Start
Contact
Print
General Help
