|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
75 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A bound on the k-gonality of facets of the hypermetric cone and related complexity problems |
Avis, D. |
1993 |
70-71 | 5 |
p. 241-254 14 p. |
article |
|
| 2 | Absolute approximation of Tukey depth: Theory and experiments |
Chen, Dan |
2013 |
70-71 | 5 |
p. 566-573 8 p. |
article |
|
| 3 | A dihedral acute triangulation of the cube |
VanderZee, Evan |
2010 |
70-71 | 5 |
p. 445-452 8 p. |
article |
|
| 4 | Algorithms for drawing graphs: an annotated bibliography |
Battista, Giuseppe Di |
1994 |
70-71 | 5 |
p. 235-282 48 p. |
article |
|
| 5 | Algorithms for proximity problems in higher dimensions |
Dickerson, Matthew T. |
1996 |
70-71 | 5 |
p. 277-291 15 p. |
article |
|
| 6 | All convex polyhedra can be clamped with parallel jaw grippers |
Bose, Prosenjit |
1996 |
70-71 | 5 |
p. 291-302 12 p. |
article |
|
| 7 | A modified Frank–Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms |
Ahipaşaoğlu, S. Damla |
2013 |
70-71 | 5 |
p. 494-519 26 p. |
article |
|
| 8 | An O ( n 5 / 2 log n ) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions |
Wagner, David P. |
2009 |
70-71 | 5 |
p. 376-387 12 p. |
article |
|
| 9 | A robust segment/triangle intersection algorithm for interference tests. Efficiency study |
Jiménez, Juan J. |
2010 |
70-71 | 5 |
p. 474-492 19 p. |
article |
|
| 10 | A vertex-face assignment for plane graphs |
Souvaine, Diane L. |
2009 |
70-71 | 5 |
p. 388-394 7 p. |
article |
|
| 11 | Compatible spanning trees |
García, Alfredo |
2014 |
70-71 | 5 |
p. 563-584 22 p. |
article |
|
| 12 | Computing convex hull in a floating point arithmetic |
Jaromczyk, Jerzy W. |
1994 |
70-71 | 5 |
p. 283-292 10 p. |
article |
|
| 13 | Computing the bounded subcomplex of an unbounded polyhedron |
Herrmann, Sven |
2013 |
70-71 | 5 |
p. 541-551 11 p. |
article |
|
| 14 | Constructing the convex hull of a partially sorted set of points |
Goodrich, Michael T. |
1993 |
70-71 | 5 |
p. 267-278 12 p. |
article |
|
| 15 | Controlled Perturbation of sets of line segments in R 2 with smart processing order |
Packer, Eli |
2011 |
70-71 | 5 |
p. 265-285 21 p. |
article |
|
| 16 | Counting triangulations and other crossing-free structures approximately |
Alvarez, Victor |
2015 |
70-71 | 5 |
p. 386-397 12 p. |
article |
|
| 17 | Covering a simple polygon by monotone directions |
Ahn, Hee-Kap |
2010 |
70-71 | 5 |
p. 514-523 10 p. |
article |
|
| 18 | Covering points with orthogonally convex polygons |
Genç, Burkay |
2011 |
70-71 | 5 |
p. 249-264 16 p. |
article |
|
| 19 | Dynamic ham-sandwich cuts in the plane |
Abbott, Timothy G. |
2009 |
70-71 | 5 |
p. 419-428 10 p. |
article |
|
| 20 | Editorial |
Bremner, David |
2013 |
70-71 | 5 |
p. 493- 1 p. |
article |
|
| 21 | Editorial Board |
2009 |
70-71 | 5 |
p. IFC- 1 p. |
article |
||
| 22 | Editorial CCCG 2005 |
Bose, Prosenjit |
2009 |
70-71 | 5 |
p. 363- 1 p. |
article |
|
| 23 | Editorial CCCG 2006 |
Meijer, Henk |
2009 |
70-71 | 5 |
p. 463- 1 p. |
article |
|
| 24 | Embeddability of open-ended carbon nanotubes in hypercubes |
Zhang, Heping |
2010 |
70-71 | 5 |
p. 524-534 11 p. |
article |
|
| 25 | Exact join detection for convex polyhedra and other numerical abstractions |
Bagnara, Roberto |
2010 |
70-71 | 5 |
p. 453-473 21 p. |
article |
|
| 26 | Faster geometric k-point MST approximation |
Eppstein, David |
1997 |
70-71 | 5 |
p. 231-240 10 p. |
article |
|
| 27 | Flip distance between triangulations of a planar point set is APX-hard |
Pilz, Alexander |
2014 |
70-71 | 5 |
p. 589-604 16 p. |
article |
|
| 28 | Generalized hidden surface removal |
de Berg, Mark |
1996 |
70-71 | 5 |
p. 249-276 28 p. |
article |
|
| 29 | Generating random polygons with given vertices |
Zhu, Chong |
1996 |
70-71 | 5 |
p. 277-290 14 p. |
article |
|
| 30 | Geometric conditions for Euclidean Steiner trees in ℜ d |
Van Laarhoven, Jon W. |
2013 |
70-71 | 5 |
p. 520-531 12 p. |
article |
|
| 31 | Geometric red–blue set cover for unit squares and related problems |
Chan, Timothy M. |
2015 |
70-71 | 5 |
p. 380-385 6 p. |
article |
|
| 32 | Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG) |
López-Ortiz, Alejandro |
2015 |
70-71 | 5 |
p. 369- 1 p. |
article |
|
| 33 | Hidden surface removal for c-oriented polyhedra |
Berg, Mark de |
1992 |
70-71 | 5 |
p. 247-268 22 p. |
article |
|
| 34 | Hunting Voronoi vertices |
Vleugels, Jules |
1996 |
70-71 | 5 |
p. 329-354 26 p. |
article |
|
| 35 | Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom |
Halperin, Dan |
1992 |
70-71 | 5 |
p. 269-303 35 p. |
article |
|
| 36 | Local overlaps in special unfoldings of convex polyhedra |
Lucier, Brendan |
2009 |
70-71 | 5 |
p. 495-504 10 p. |
article |
|
| 37 | Lower bounds for the number of small convex k-holes |
Aichholzer, Oswin |
2014 |
70-71 | 5 |
p. 605-613 9 p. |
article |
|
| 38 | Mathematical model and efficient algorithms for object packing problem |
Chernov, N. |
2010 |
70-71 | 5 |
p. 535-553 19 p. |
article |
|
| 39 | Maximal and minimal balls |
Dwyer, Rex A. |
1993 |
70-71 | 5 |
p. 261-275 15 p. |
article |
|
| 40 | Maximum overlap of convex polytopes under translation |
Ahn, Hee-Kap |
2013 |
70-71 | 5 |
p. 552-565 14 p. |
article |
|
| 41 | Minimal tangent visibility graphs |
Pocchiola, Michel |
1996 |
70-71 | 5 |
p. 303-314 12 p. |
article |
|
| 42 | Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs |
Durocher, S. |
2011 |
70-71 | 5 |
p. 286-302 17 p. |
article |
|
| 43 | Morphing polyhedra with parallel faces: Counterexamples |
Biedl, Therese |
2009 |
70-71 | 5 |
p. 395-402 8 p. |
article |
|
| 44 | Octants are cover-decomposable into many coverings |
Keszegh, Balázs |
2014 |
70-71 | 5 |
p. 585-588 4 p. |
article |
|
| 45 | On the degree of standard geometric predicates for line transversals in 3D |
Everett, Hazel |
2009 |
70-71 | 5 |
p. 484-494 11 p. |
article |
|
| 46 | On the finite set of missing geometric configurations ( n 4 ) |
Bokowski, Jürgen |
2013 |
70-71 | 5 |
p. 532-540 9 p. |
article |
|
| 47 | On the number of simplicial complexes in R d |
Dey, Tamal K. |
1997 |
70-71 | 5 |
p. 267-277 11 p. |
article |
|
| 48 | On the recognition of digital circles in linear time |
Sauer, Peter |
1993 |
70-71 | 5 |
p. 287-302 16 p. |
article |
|
| 49 | On the union of fat wedges and separating a collection of segments by a line |
Efrat, Alon |
1993 |
70-71 | 5 |
p. 277-288 12 p. |
article |
|
| 50 | On vertical ray shooting in arrangements |
Matoušek, Jiří |
1993 |
70-71 | 5 |
p. 279-285 7 p. |
article |
|
| 51 | Optimal on-line algorithms for walking with minimum number of turns in unknown streets |
Ghosh, Subir Kumar |
1997 |
70-71 | 5 |
p. 241-266 26 p. |
article |
|
| 52 | Optimal tetrahedralization of the 3D-region “between” a convex polyhedron and a convex polygon |
Palios, Leonidas |
1996 |
70-71 | 5 |
p. 263-276 14 p. |
article |
|
| 53 | Outerplanar graph drawings with few slopes |
Knauer, Kolja |
2014 |
70-71 | 5 |
p. 614-624 11 p. |
article |
|
| 54 | Polynomial-time instances of the minimum weight triangulation problem |
Anagnostou, Efthymios |
1993 |
70-71 | 5 |
p. 247-259 13 p. |
article |
|
| 55 | Probing polygons minimally is hard |
Belleville, Patrice |
1993 |
70-71 | 5 |
p. 255-265 11 p. |
article |
|
| 56 | Queries on Voronoi diagrams of moving points |
Devillers, O. |
1996 |
70-71 | 5 |
p. 315-327 13 p. |
article |
|
| 57 | Reprint of: Bounding the locus of the center of mass for a part with shape variation |
Panahi, Fatemeh |
2015 |
70-71 | 5 |
p. 398-406 9 p. |
article |
|
| 58 | Reprint of: Face-guarding polyhedra |
Viglietta, Giovanni |
2015 |
70-71 | 5 |
p. 415-428 14 p. |
article |
|
| 59 | Reprint of: Theta-3 is connected |
Aichholzer, Oswin |
2015 |
70-71 | 5 |
p. 407-414 8 p. |
article |
|
| 60 | Reprint of: Weighted straight skeletons in the plane |
Biedl, Therese |
2015 |
70-71 | 5 |
p. 429-442 14 p. |
article |
|
| 61 | Rotationally monotone polygons |
Bose, Prosenjit |
2009 |
70-71 | 5 |
p. 471-483 13 p. |
article |
|
| 62 | Shortest descending paths through given faces |
Ahmed, Mustaq |
2009 |
70-71 | 5 |
p. 464-470 7 p. |
article |
|
| 63 | Similarity of polygonal curves in the presence of outliers |
De Carufel, Jean-Lou |
2014 |
70-71 | 5 |
p. 625-641 17 p. |
article |
|
| 64 | Simplex range reporting on a pointer machine |
Chazelle, Bernard |
1996 |
70-71 | 5 |
p. 237-247 11 p. |
article |
|
| 65 | Single facility collection depots location problem in the plane |
Benkoczi, Robert |
2009 |
70-71 | 5 |
p. 403-418 16 p. |
article |
|
| 66 | Small weak epsilon-nets |
Aronov, Boris |
2009 |
70-71 | 5 |
p. 455-462 8 p. |
article |
|
| 67 | Solving the natural wireless localization problem to optimality efficiently |
Crepaldi, Bruno E. |
2015 |
70-71 | 5 |
p. 370-379 10 p. |
article |
|
| 68 | Stabbers of line segments in the plane |
Claverol, Mercè |
2011 |
70-71 | 5 |
p. 303-318 16 p. |
article |
|
| 69 | Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions |
de Berg, Mark |
2010 |
70-71 | 5 |
p. 493-513 21 p. |
article |
|
| 70 | The complexity of finding minimal Voronoi covers with applications to machine learning |
Heath, David |
1993 |
70-71 | 5 |
p. 289-305 17 p. |
article |
|
| 71 | The distance geometry of music |
Demaine, Erik D. |
2009 |
70-71 | 5 |
p. 429-454 26 p. |
article |
|
| 72 | The projection median of a set of points |
Durocher, Stephane |
2009 |
70-71 | 5 |
p. 364-375 12 p. |
article |
|
| 73 | The union of colorful simplices spanned by a colored point set |
Schulz, André |
2013 |
70-71 | 5 |
p. 574-590 17 p. |
article |
|
| 74 | Vector summation within minimal angle |
Avgustinovich, S.V. |
1993 |
70-71 | 5 |
p. 235-239 5 p. |
article |
|
| 75 | Voronoi Diagrams on orbifolds |
Mazón, M. |
1997 |
70-71 | 5 |
p. 219-230 12 p. |
article |
75 results found