default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th SCG 2011: Paris, France
- Ferran Hurtado, Marc J. van Kreveld:
Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011. ACM 2011, ISBN 978-1-4503-0682-9
Session 1 (Monday, June 13, 9: 00 - 10: 20 am)
- Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu:
Orthogonal range searching on the RAM, revisited. 1-10 - Esther Ezra, Wolfgang Mulzer
:
Convex hull of imprecise points in o(n log n) time after preprocessing. 11-20 - John Iacono:
A static optimality transformation with applications to planar point location. 21-26 - Timothy M. Chan:
Three problems about dynamic convex hulls. 27-36
Session 2 (Monday, June 13, 10: 50 am - 12: 10 pm)
- Mridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov:
Metric graph reconstruction from noisy data. 37-46 - Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phillips, Suresh Venkatasubramanian:
Comparing distributions and shapes using the kernel distance. 47-56 - Leonidas J. Guibas, Quentin Mérigot, Dmitriy Morozov:
Witnessed k-distance. 57-64 - Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Stochastic minimum spanning trees in euclidean spaces. 65-74
Session 3: invited talk (Monday, June 13, 2: 10 - 3: 00 pm)
- Jan Kratochvíl:
Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs). 75-76
Session 4 (Monday, June 13, 3: 15 - 4: 15 pm)
- Pankaj K. Agarwal, Thomas Mølhave, Hai Yu, James S. Clark:
Exploiting temporal coherence in forest dynamics simulation. 77-86 - Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin:
Compressive sensing with local geometric features. 87-96 - Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba:
Persistence-based clustering in riemannian manifolds. 97-106
Session 5 (Monday, June 13, 4: 40 - 5: 40 pm)
- Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A kuratowski-type theorem for planarity of partially embedded graphs. 107-116 - Vida Dujmovic, Stefan Langerman:
A center transversal theorem for hyperplanes and applications to graph drawing. 117-124 - Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint compatible geometric matchings. 125-134
Session 6a (Tuesday, June 14, 9: 00 - 10: 20 am)
- Nathan M. Dunfield, Anil N. Hirani:
The least spanning area of a knot and the optimal bounding chain problem. 135-144 - Benjamin A. Burton, Melih Ozlen:
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. 145-152 - Benjamin A. Burton:
The pachner graph and the simplification of 3-sphere triangulations. 153-162 - Boris Bukh, Alfredo Hubard:
Space crossing numbers. 163-170
Session 6b (Tuesday, June 14, 9: 00 - 10: 20 am)
- Stefan Huber, Martin Held:
Theoretical and practical results on straight skeletons of planar straight-line graphs. 171-178 - Eric Berberich, Michael Hemmer, Michael Kerber:
A generic algebraic kernel for non-linear geometric applications. 179-186 - Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing approximate offsets. 187-196 - John Hershberger:
Stable snap rounding. 197-206
Session 7a (Tuesday, June 14, 10: 50 am - 12: 10 pm)
- Chao Chen, Michael Kerber:
An output-sensitive algorithm for persistent homology. 207-216 - Nikola Milosavljevic, Dmitriy Morozov, Primoz Skraba:
Zigzag persistent homology in matrix multiplication time. 216-225 - Tamal K. Dey, Yusu Wang:
Reeb graphs: approximation and persistence. 226-235 - Jeff Erickson:
Shortest non-trivial cycles in directed surface graphs. 236-243
Session 7b (Tuesday, June 14, 10: 50 am - 12: 10 pm)
- Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic convex hulls and delaunay triangulations in the black-box model. 244-253 - Daniel Reem:
The geometric stability of voronoi diagrams with respect to small changes of the sites. 254-263 - Ge Xia:
Improved upper bound on the stretch factor of delaunay triangulations. 264-273 - Manuel Caroli, Monique Teillaud:
Delaunay triangulations of point sets in closed euclidean d-manifolds. 274-282
Session 8 video & multimedia (Tuesday, June 14, 12: 45 - 2: 00 pm)
- Gadi Aleksandrowicz, Gill Barequet:
Redelmeier's algorithm for counting lattice animals. 283-284 - Paul Accisano, Alper Üngör:
Geometric computation with smart pixels. 285-286 - Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe:
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains. 287-288 - Attila Gyulassy, Joshua A. Levine, Valerio Pascucci:
Visualization of discrete gradient construction. 289-290 - Jack Snoeyink, Vishal Verma:
Fitting spheres to electron density. 291-292 - Christophe Weibel, Linqiao Zhang:
Minimum perimeter convex hull of imprecise points in convex regions. 293-294 - Olivier Devillers, Pedro Machado Manhães de Castro:
A pedagogic JavaScript program for point location strategies. 295-296
Session 9: invited talk (Tuesday, June 14, 2: 10 - 3: 00 pm)
- Ross S. Purves:
Answering geographic questions with user generated content: experiences from the coal face. 297-299
Session 10a (Tuesday, June 14, 3: 15 - 4: 15 pm)
- Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer representations of convex polygon intersection graphs. 300-307 - Ross J. Kang, Tobias Müller:
Sphere and dot product representations of graphs. 308-314 - Stefan Felsner, Mathew C. Francis:
Contact representations of planar graphs with cubes. 315-320
Session 10b (Tuesday, June 14, 3: 15 - 4: 15 pm)
- Gary L. Miller, Todd Phillips, Don Sheehy:
Beating the spread: time-optimal point meshing. 321-330 - Siu-Wing Cheng, Jiongxin Jin:
Edge flips and deforming surface meshes. 331-340 - Umut A. Acar, Benoît Hudson, Duru Türkoglu:
Kinetic mesh refinement in 2D. 341-350
Session 11a (Tuesday, June 14, 4: 40 - 6: 00 pm)
- Uli Wagner:
Minors in random and expanding hypergraphs. 351-360 - David Eppstein, Maarten Löffler:
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. 361-369 - Seth Pettie:
On the structure and composition of forbidden sequences, with geometric applications. 370-379 - Alexander Gilbers, Rolf Klein:
A new upper bound for the VC-dimension of visibility regions. 380-386
Session 11b (Tuesday, June 14, 4: 40 - 6: 00 pm)
- Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
Guarding polyominoes. 387-396 - Menelaos I. Karavelas, Eleni Tzanaki:
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes. 397-406 - Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi:
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. 407-416 - Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
Covering cubes and the closest vector problem. 417-423
Session 12 (Wednesday, June 15, 9: 00 - 10: 20 am)
- Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský:
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. 424-432 - A. Karim Abu-Affash:
On the euclidean bottleneck full Steiner tree problem. 433-439 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal:
The euclidean bottleneck steiner path problem. 440-447 - Sariel Har-Peled, Benjamin Raichel:
The frechet distance revisited and extended. 448-457
Session 13 (Wednesday, June 15, 10: 50 - 12: 10 am)
- János Pach, Gábor Tardos:
Tight lower bounds for the size of epsilon-nets. 458-463 - René Brandenberg, Stefan König:
No dimension independent core-sets for containment under homothetics. 464-471 - Ciprian Borcea, Ileana Streinu:
Extremal reaches in polynomial time. 472-480 - Ciprian Borcea, Ileana Streinu:
Exact workspace boundary by extremal reaches. 481-490
Session 14 (Wednesday, June 15, 14: 10 - 15: 10 am)
- Dominique Attali, André Lieutier, David Salinas:
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes. 491-500 - Dominique Attali, André Lieutier, David Salinas:
Efficient data structure for representing and simplifying simplicial complexes in high dimensions. 501-509 - Nicolas Chevallier, Yvan Maillot:
Boundary of a non-uniform point cloud for reconstruction: extended abstract. 510-518
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
