Result 1 to 20 of 92 total
On point-sets that support planar graphs. (English)
Comput. Geom. 46, No. 1, 29-50 (2013).
1
On the complexity of sets of free lines and line segments among balls in three dimensions. (English)
Discrete Comput. Geom. 47, No. 4, 756-772 (2012).
2
On point-sets that support planar graphs. (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, 64-74 (2012).
3
Farthest-polygon Voronoi diagrams. (English)
Comput. Geom. 44, No. 4, 234-247 (2011).
4
On point-sets that support planar graphs (English)
Graph Drawing, 64-74 (2011).
5
A succinct 3D visibility skeleton. (English)
Discrete Math. Algorithms Appl. 2, No. 4, 567-589 (2010).
6
On the topology of real algebraic plane curves. (English)
Math. Comput. Sci. 4, No. 1, 113-137 (2010).
7
On the computation of 3D visibility skeletons. (English)
Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19‒21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 469-478 (2010).
8
Farthest-polygon Voronoi diagrams. (English)
Comput. Res. Repos. 2010, Article No. 1001.3593 (2010).
9
Universal sets of $n$ points for one-bend drawings of planar graphs with $n$ vertices. (English)
Discrete Comput. Geom. 43, No. 2, 272-288 (2010).
10
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. (English)
Comput. Geom. 43, No. 3, 295-311 (2010).
11
Special issue: Selected papers based on the presentations at the 24th European workshop on computational geometry (EuroCG’08), Nancy, France, March 18‒20, 2008. (English)
Comput. Geom. 43, No. 3, 233-328 (2010).
12
Special issue: Selected papers based on the presentations at the 24th European workshop on computational geometry (EuroCG’08), Nancy, France, March 18‒20, 2008. (English)
Comput. Geom. 43, No. 2, 223-328 (2010).
13
On the topology of real algebraic plane curves (English)
Mathematics in Computer Science 4, No. 1, 113-137 (2010).
14
Foreword (English)
Mathematics in Computer Science 4, No. 1, 1-2 (2010).
15
Universal sets of $n$ points for one-bend drawings of planar graphs with $n$ vertices (English)
Discrete & Computational Geometry 43, No. 2, 272-288 (2010).
16
On the complexity of sets of free lines and line segments among balls in three dimensions (English)
Symposium on Computational Geometry, 48-57 (2010).
17
On the computation of 3D visibility skeletons (English)
COCOON, 469-478 (2010).
18
The Voronoi diagram of three lines. (English)
Discrete Comput. Geom. 42, No. 1, 94-130 (2009).
19
On the complexity of umbra and penumbra. (English)
Comput. Geom. 42, No. 8, 758-771 (2009).
20
Result 1 to 20 of 92 total
Start
Contact
Print
General Help
