History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 121 total

Blocking Delaunay triangulations. (English)
Comput. Geom. 46, No. 2, 154-159 (2013).
1
Maximizing maximal angles for plane straight-line graphs. (English)
Comput. Geom. 46, No. 1, 17-28 (2013).
2
Einführung in die Geometrie (to appear). (German)
Berlin: Springer (ISBN 978-3-0346-0143-6/pbk). 150~p. EUR~18.90; SFR~29.90 (2013).
3
Geodesic order types. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 216-227 (2012).
4
Pointed drawings of planar graphs. (English)
Comput. Geom. 45, No. 9, 482-494 (2012).
5
On $k$-convex polygons. (English)
Comput. Geom. 45, No. 3, 73-87 (2012).
6
Triangulations with circular ARCS. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 296-307 (2012).
7
Exact medial axis computation for circular arc boundaries. (English)
Boissonnat, Jean-Daniel (ed.) et al., Curves and surfaces. 7th international conference, Avignon, France, June 24‒30, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-27412-1/pbk). Lecture Notes in Computer Science 6920, 28-42 (2012).
8
Exact medial axis computation for triangulated solids with respect to piecewise linear metrics. (English)
Boissonnat, Jean-Daniel (ed.) et al., Curves and surfaces. 7th international conference, Avignon, France, June 24‒30, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-27412-1/pbk). Lecture Notes in Computer Science 6920, 1-27 (2012).
9
Computational and structural advantages of circular boundary representation. (English)
Int. J. Comput. Geom. Appl. 21, No. 1, 47-69 (2011).
10
Triangulations with circular arcs (English)
Graph Drawing, 296-307 (2011).
11
Divide-and-conquer for Voronoi diagrams revisited. (English)
Comput. Geom. 43, No. 8, 688-699 (2010).
12
Edge-removal and non-crossing configurations in geometric graphs. (English)
Discrete Math. Theor. Comput. Sci. 12, No. 1, 75-86, electronic only (2010).
13
Edge-removal and non-crossing configurations in geometric graphs (English)
Discrete Mathematics & Theoretical Computer Science 12, No. 1, 75-86 (2010).
14
Compatible pointed pseudo-triangulations (English)
CCCG, 91-94 (2010).
15
Blocking Delaunay triangulations (English)
CCCG, 21-24 (2010).
16
Playing pylos with an autonomous robot (English)
IROS, 2507-2508 (2010).
17
Medial axis computation for planar free-form shapes. (English)
Comput.-Aided Des. 41, No. 5, 339-349 (2009).
18
Recovering structure from $r$-sampled objects. (English)
Comput. Graph. Forum 28, No. 5, 1349-1360 (2009).
19
New results on lower bounds for the number of $(\leq k)$-facets. (English)
Eur. J. Comb. 30, No. 7, 1568-1574 (2009).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 121 total