Result 1 to 20 of 84 total
Acute triangulations of convex quadrilaterals. (English)
Discrete Appl. Math. 160, No. 7-8, 1253-1256 (2012).
1
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes. (English)
Ann. Oper. Res. 189, 331-342 (2011).
2
Computational and structural advantages of circular boundary representation. (English)
Int. J. Comput. Geom. Appl. 21, No. 1, 47-69 (2011).
3
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).
4
Geometric methods and applications. For computer science and engineering. 2nd ed. (English)
Texts in Applied Mathematics 38. Dordrecht: Springer (ISBN 978-1-4419-9960-3/hbk; 978-1-4419-9961-0/ebook). xxvii, 680~p. EUR~69.95/net; SFR~100.50; \$~89.95; \sterling~62.99 (2011).
5
Almost all Delaunay triangulations have stretch factor greater than $π/2$. (English)
Comput. Geom. 44, No. 2, 121-127 (2011).
6
On the stretch factor of Delaunay triangulations of points in convex position. (English)
Comput. Geom. 44, No. 2, 104-109 (2011).
7
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs. (English)
Comput. Geom. 44, No. 1, 20-51 (2011).
8
Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons. (English)
Serdica J. Comput. 4, No. 3, 335-348 (2010).
9
Optimal triangulations of points and segments with Steiner points. (English)
Int. J. Comput. Geom. Appl. 20, No. 1, 89-104 (2010).
10
Optimization for first order Delaunay triangulations. (English)
Comput. Geom. 43, No. 4, 377-394 (2010).
11
Voronoi diagram generation algorithm based on Delaunay triangulation. (English)
J. Comput. Appl. 30, No. 1, 75-77 (2010).
12
A clustering algorithm based on Delaunay triangulation density metric. (Chinese)
J. Comput. Appl. 29, No. 5, 1378-1381 (2009).
13
Convex local data in $ {\Bbb R}^{3} $ by convex smooth functions. (English)
C. R. Acad. Bulg. Sci. 61, No. 7, 839-846 (2008).
14
Construction of 3D convex and weakly nonconvex hulls in problems of mathematical physics. (English)
Russ. J. Numer. Anal. Math. Model. 22, No. 6, 591-600 (2007).
15
Triangulating a convex polygon with fewer number of non-standard bars. (English)
Theor. Comput. Sci. 389, No. 1-2, 143-151 (2007).
16
Globally optimal estimates for geometric reconstruction problems. (English)
Int. J. Comput. Vis. 74, No. 1, 3-15 (2007).
17
A modification of the Fourier-Motskin algorithm for constructing a triangulation and its star coloring. (Russian)
Diskretn. Anal. Issled. Oper., Ser. 2 13, No. 1, 77-94 (2006).
18
Piecewise linear mappings with non-convex range. (English)
Bul. Ştiinţ., Univ. Piteşti, Ser. Mat. Inf. 12, 93-100 (2006).
19
Inherently parallel geometric computations. (English)
Parallel Process. Lett. 16, No. 1, 19-37 (2006).
20
Result 1 to 20 of 84 total
Start
Contact
Print
General Help
