Result 1 to 20 from 32 total
Pairs of convex bodies with centrally symmetric intersections of translates (English)
Discrete & Computational Geometry 33, No. 4, 605-616 (2005).
1
The characteristic intersection property of line-free Choquet simplices in $E^{d}$ (English)
Discrete & Computational Geometry 29, No. 4, 561-573 (2003).
2
Minimum number of pieces in a convex partition of a polygonal domain. (English)
Int. J. Comput. Geom. Appl. 9, No. 6, 599-614 (1999).
3
Geometric methods and optimization problems. (English)
Combinatorial Optimization. 4. Dordrecht: Kluwer Academic Publishers. viii, 429 p. Dfl. 340.00; \$ 204.00; \sterling 119.00 (1999).
4
On grünbaum’s conjecture about inner illumination of convex bodies (English)
Discrete & Computational Geometry 22, No. 3, 403-410 (1999).
5
A characterization of homothetic simplices (English)
Discrete & Computational Geometry 22, No. 2, 193-200 (1999).
6
Minimum convex partition of a polygon with holes by cuts in given directions. (English)
Theory Comput. Syst. 31, No.5, 507-538 (1998).
7
Minimum convex partition of polygonal domains by guillotine cuts (English)
Discrete & Computational Geometry 19, No. 2, 291-305 (1998).
8
Minimum convex partition of a polygon with holes by cuts in given directions (English)
ISAAC, 315-325 (1996).
9
On antipodal and adjoint pairs of points for two convex bodies (English)
Discrete & Computational Geometry 13, 629-636 (1995).
10
On geodetic characteristic of networks. (English)
Stud. Cercet. Mat. 46, No.5, 521-527 (1994).
11
Some Erdős-Szekeres type results about points in space. (English)
Monatsh. Math. 118, No.1-2, 33-40 (1994).
12
Lower bounds for the numbers of antipodal pairs and strictly antipodal pairs of vertices in a convex polytope (English)
Discrete & Computational Geometry 11, 149-162 (1994).
13
Minimum number of trapezoids partitioning a polygonal region. (English)
Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Math. 36, 47-60 (1993).
14
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles. (English)
Discrete Comput. Geom. 9, No.1, 57-79 (1993).
15
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (English)
Discrete & Computational Geometry 9, 57-79 (1993).
16
Joins and half-shadows of d-convex sets in triangulated graphs. (English)
Topological, projective and combinatorial properties of spaces, 69-88 (1992).
17
Minimum dissection of rectilinear polygon with arbitrary holes into rectangles (English)
Symposium on Computational Geometry, 296-302 (1992).
18
Metric convexity in graphs. (English)
Stud. Univ. Babeş-Bolyai, Math. 36, No.4, 3-43 (1991).
19
Simple algorithms for decomposing a domain on a rectangle in problems of large integral schemes projections. (Russian)
Izv. Akad. Nauk Mold. SSR, Ser. Fiz.-Tekh. Mat. Nauk 1989, No.2, 19-25 (1989).
20
Result 1 to 20 from 32 total
Start
Contact
Print
General Help
