Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             55 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Algorithms for generalized halfspace range searching and other intersection searching problems Gupta, Prosenjit
1996
6 p. 321-340
20 p.
artikel
2 An almost linear time algorithm for field splitting in radiation therapy Wu, Xiaodong
2013
6 p. 673-687
15 p.
artikel
3 An optimal greedy routing algorithm for triangulated polygons Kulkarni, Omkar
2013
6 p. 640-647
8 p.
artikel
4 Approximate proximity drawings Evans, William
2013
6 p. 604-614
11 p.
artikel
5 A proof of the Oja depth conjecture in the plane Mustafa, Nabil H.
2014
6 p. 668-674
7 p.
artikel
6 Author index of volume 6 (1996) 1996
6 p. 405-406
2 p.
artikel
7 Author index of Volume 8 (1997) 1997
6 p. 335-336
artikel
8 Author index to volume 5 (1996) 1996
6 p. 341-342
2 p.
artikel
9 Author index to volume 2 (1993) 1993
6 p. 355-356
2 p.
artikel
10 Author index to volume 4 (1994) 1994
6 p. 345-346
2 p.
artikel
11 Author index to volume 1 (1992) 1992
6 p. 353-
1 p.
artikel
12 Author index to volume 3 (1993) 1993
6 p. 375-376
2 p.
artikel
13 Complexity of projected images of convex subdivisions Hirata, Tomio
1994
6 p. 293-308
16 p.
artikel
14 Computing rectangle enclosures Bistiolas, V.
1993
6 p. 303-308
6 p.
artikel
15 Computing the L 1 geodesic diameter and center of a simple polygon in linear time Bae, Sang Won
2015
6 p. 495-505
11 p.
artikel
16 Convex hulls of spheres and convex hulls of disjoint convex polytopes Karavelas, Menelaos I.
2013
6 p. 615-630
16 p.
artikel
17 Counting and cutting cycles of lines and rods in space Chazelle, Bernard
1992
6 p. 305-323
19 p.
artikel
18 Counting problems relating to a theorem of Dirichlet Kranakis, Evangelos
1994
6 p. 309-325
17 p.
artikel
19 Covering grids and orthogonal polygons with periscope guards Gewali, Laxmi P.
1993
6 p. 309-334
26 p.
artikel
20 Design of solids for antigravity motion illusion Sugihara, Kokichi
2014
6 p. 675-682
8 p.
artikel
21 Disconnectivity and relative positions in simultaneous embeddings Bläsius, Thomas
2015
6 p. 459-478
20 p.
artikel
22 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects Katz, Matthew J.
1997
6 p. 299-316
artikel
23 Dynamic well-spaced point sets Acar, Umut A.
2013
6 p. 756-773
18 p.
artikel
24 Editorial Hoffmann, Michael
2014
6 p. 643-
1 p.
artikel
25 Equivariant mappings: a new approach in stochastic simulations Schindler, W.
1994
6 p. 327-343
17 p.
artikel
26 Fast algorithms for approximate Fréchet matching queries in geometric trees Gudmundsson, Joachim
2015
6 p. 479-494
16 p.
artikel
27 Fast algorithms for collision and proximity problems involving moving geometric objects Gupta, Prosenjit
1996
6 p. 371-391
21 p.
artikel
28 Fast Fréchet queries de Berg, Mark
2013
6 p. 747-755
9 p.
artikel
29 Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions VanderZee, Evan
2013
6 p. 700-724
25 p.
artikel
30 4-Holes in point sets Aichholzer, Oswin
2014
6 p. 644-650
7 p.
artikel
31 How many maxima can there be? Golin, Mordecai J.
1993
6 p. 335-353
19 p.
artikel
32 Large convex holes in random point sets Balogh, József
2013
6 p. 725-733
9 p.
artikel
33 Minimum-link paths revisited Mitchell, Joseph S.B.
2014
6 p. 651-667
17 p.
artikel
34 New results on binary space partitions in the plane de Berg, Mark
1997
6 p. 317-333
artikel
35 On counting triangulations in d dimensions Dey, Tamal Krishna
1993
6 p. 315-325
11 p.
artikel
36 On full Steiner trees in unit disk graphs Biniaz, Ahmad
2015
6 p. 453-458
6 p.
artikel
37 On growing connected β-skeletons Adamatzky, Andrew
2013
6 p. 805-816
12 p.
artikel
38 On-line construction of the upper envelope of triangles and surface patches in three dimensions Boissonnat, Jean-Daniel
1996
6 p. 303-320
18 p.
artikel
39 On numbers of pseudo-triangulations Ben-Ner, Moria
2013
6 p. 688-699
12 p.
artikel
40 On parallel rectilinear obstacle- avoiding paths Atallah, Mikhail J.
1993
6 p. 307-313
7 p.
artikel
41 On the area of the intersection of disks in the plane Capoyleas, Vasilis
1996
6 p. 393-396
4 p.
artikel
42 On the multisearching problem for hypercubes Atallah, Mikhail J.
1996
6 p. 293-302
10 p.
artikel
43 On the power of the semi-separated pair decomposition Abam, Mohammad Ali
2013
6 p. 631-639
9 p.
artikel
44 On upward point set embeddability Kaufmann, Michael
2013
6 p. 774-804
31 p.
artikel
45 Randomized incremental construction of simple abstract Voronoi diagrams in 3-space Lê, Ngłc-Minh
1997
6 p. 279-298
artikel
46 Representing polyhedra: faces are better than vertices Heath, Lenwood S.
1993
6 p. 327-351
25 p.
artikel
47 Shape matching under rigid motion Cheng, Siu-Wing
2013
6 p. 591-603
13 p.
artikel
48 Space reduction and an extension for a hidden line elimination algorithm Kitsios, Nectarios
1996
6 p. 397-404
8 p.
artikel
49 The 2-center problem in three dimensions Agarwal, Pankaj K.
2013
6 p. 734-746
13 p.
artikel
50 The complexity of the free space for a robot moving amidst fat obstacles van der Stappen, A.Frank
1993
6 p. 353-373
21 p.
artikel
51 The cost of bounded curvature Kim, Hyo-Sil
2013
6 p. 648-672
25 p.
artikel
52 Treemaps with bounded aspect ratio de Berg, Mark
2014
6 p. 683-693
11 p.
artikel
53 Triangulations, visibility graph and reflex vertices of a simple polygon Hurtado, F.
1996
6 p. 355-369
15 p.
artikel
54 Walking an unknown street with bounded detour Klein, Rolf
1992
6 p. 325-351
27 p.
artikel
55 Weak visibility queries of line segments in simple polygons Chen, Danny Z.
2015
6 p. 443-452
10 p.
artikel
                             55 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland