Search results for "Symposium on Computational Geometry"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Manuel Caroli, Monique Teillaud	Delaunay triangulations of point sets in closed euclidean d-manifolds.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Umut A. Acar, Benoît Hudson, Duru Türkoglu	Kinetic mesh refinement in 2D.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Paul Accisano, Alper Üngör	Geometric computation with smart pixels.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova	Deconstructing approximate offsets.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Thomas Mølhave, Hai Yu, James S. Clark	Exploiting temporal coherence in forest dynamics simulation.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier	Covering cubes and the closest vector problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal	The euclidean bottleneck steiner path problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ross J. Kang, Tobias Müller	Sphere and dot product representations of graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Vít Jelínek, Jan Kratochvíl, Ignaz Rutter	A kuratowski-type theorem for planarity of partially embedded graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Boris Bukh, Alfredo Hubard	Space crossing numbers.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Menelaos I. Karavelas, Eleni Tzanaki	Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Sariel Har-Peled, Benjamin Raichel	The frechet distance revisited and extended.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Gadi Aleksandrowicz, Gill Barequet	Redelmeier's algorithm for counting lattice animals.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Nathan M. Dunfield, Anil N. Hirani	The least spanning area of a knot and the optimal bounding chain problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Nikola Milosavljevic, Dmitriy Morozov, Primoz Skraba	Zigzag persistent homology in matrix multiplication time.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Stefan Huber, Martin Held	Theoretical and practical results on straight skeletons of planar straight-line graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Jeff Erickson	Shortest non-trivial cycles in directed surface graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Yusu Wang	Reeb graphs: approximation and persistence.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Attila Gyulassy, Joshua A. Levine, Valerio Pascucci	Visualization of discrete gradient construction.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ge Xia	Improved upper bound on the stretch factor of delaunay triangulations.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu	Orthogonal range searching on the RAM, revisited.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ciprian Borcea, Ileana Streinu	Extremal reaches in polynomial time.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth	Disjoint compatible geometric matchings.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Alexander Gilbers, Rolf Klein	A new upper bound for the VC-dimension of visibility regions.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	David Eppstein, Maarten Löffler	Bounds on the complexity of halfspace intersections when the bounded faces have small dimension.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Eric Berberich, Michael Hemmer, Michael Kerber	A generic algebraic kernel for non-linear geometric applications.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Chao Chen, Michael Kerber	An output-sensitive algorithm for persistent homology.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ferran Hurtado, Marc J. van Kreveld (eds.)	Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011	Symposium on Computational Geometry	2011	DBLP BibTeX RDF
1	Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin	Compressive sensing with local geometric features.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe	Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Mark de Berg, Marcel Roeloffzen, Bettina Speckmann	Kinetic convex hulls and delaunay triangulations in the black-box model.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	A. Karim Abu-Affash	On the euclidean bottleneck full Steiner tree problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Stefan Felsner, Mathew C. Francis	Contact representations of planar graphs with cubes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Dominique Attali, André Lieutier, David Salinas	Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba	Persistence-based clustering in riemannian manifolds.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Uli Wagner	Minors in random and expanding hypergraphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Esther Ezra, Wolfgang Mulzer	Convex hull of imprecise points in o(n log n) time after preprocessing.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, Quentin Mérigot, Dmitriy Morozov	Witnessed k-distance.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Daniel Reem	The geometric stability of voronoi diagrams with respect to small changes of the sites.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Olivier Devillers, Pedro Machado Manhães de Castro	A pedagogic JavaScript program for point location strategies.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Christophe Weibel, Linqiao Zhang	Minimum perimeter convex hull of imprecise points in convex regions.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Benjamin A. Burton, Melih Ozlen	A tree traversal algorithm for decision problems in knot theory and 3-manifold topology.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phillips, Suresh Venkatasubramanian	Comparing distributions and shapes using the kernel distance.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Jack Snoeyink, Vishal Verma	Fitting spheres to electron density.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Seth Pettie	On the structure and composition of forbidden sequences, with geometric applications.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell	Guarding polyominoes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Gary L. Miller, Todd Phillips, Don Sheehy	Beating the spread: time-optimal point meshing.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Benjamin A. Burton	The pachner graph and the simplification of 3-sphere triangulations.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen	Integer representations of convex polygon intersection graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Timothy M. Chan	Three problems about dynamic convex hulls.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	John Hershberger	Stable snap rounding.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Mridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov	Metric graph reconstruction from noisy data.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Dominique Attali, André Lieutier, David Salinas	Efficient data structure for representing and simplifying simplicial complexes in high dimensions.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Jiongxin Jin	Edge flips and deforming surface meshes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Pegah Kamousi, Timothy M. Chan, Subhash Suri	Stochastic minimum spanning trees in euclidean spaces.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	René Brandenberg, Stefan König	No dimension independent core-sets for containment under homothetics.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Jan Kratochvíl	Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs).	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Nicolas Chevallier, Yvan Maillot	Boundary of a non-uniform point cloud for reconstruction: extended abstract.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský	The potential to improve the choice: list conflict-free coloring for geometric hypergraphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ross S. Purves	Answering geographic questions with user generated content: experiences from the coal face.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	John Iacono	A static optimality transformation with applications to planar point location.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Ciprian Borcea, Ileana Streinu	Exact workspace boundary by extremal reaches.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Vida Dujmovic, Stefan Langerman	A center transversal theorem for hyperplanes and applications to graph drawing.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Lars Arge, Morten Revsbæk, Norbert Zeh	I/O-efficient computation of water flow across a terrain.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	i/o-efficient algorithms, geographical information systems, terrains
1	Anne Driemel, Sariel Har-Peled, Carola Wenk	Approximating the Fréchet distance for realistic curves in near linear time.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	frechet distance, realistic input models, approximation algorithms
1	David M. Mount, Eunhui Park	A dynamic data structure for approximate range searching.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	approximation algorithms, quadtrees, range searching, dynamic data structures, geometric data structures
1	Gur Harary, Ayellet Tal	3D Euler spirals for 3D curve completion.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	euler spirals, 3D curves
1	Micha Sharir, Adam Sheffer, Emo Welzl	On degrees in random triangulations of point sets.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	crossing-free geometric graphs, degree sequences, number of triangulatons, random triangulations, counting, charging, plane graphs
1	Joseph S. B. Mitchell	A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	approximation algorithm, TSP
1	Sergio Cabello, Bojan Mohar	Adding one edge to planar graphs makes crossing number hard.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	NP-hard, graph drawing, planar graphs, graph embedding, crossing number, topological graph theory
1	Afra Zomorodian	The tidy set: a minimal simplicial set for computing homology of clique complexes.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	simplicial set, vietoris-rips complex, computational topology, witness complex
1	Joachim Gudmundsson, Pat Morin	Planar visibility: testing and counting.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	visibility, geometric data structures
1	Dmitry N. Krasnoshchekov, Valentin Polishchuk, Arto Vihavainen	Shape approximation using k-order alpha-hulls.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	shape reconstruction
1	Jack Snoeyink, Mark de Berg, Joseph S. B. Mitchell, Günter Rote, Monique Teillaud (eds.)	Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010	Symposium on Computational Geometry	2010	DBLP BibTeX RDF
1	Adrian Dumitrescu, Evan Hilscher	Convexification of polygons by length preserving transformations.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	edge-length preserving transformation, polygon convexification, discrete geometry
1	Haim Kaplan, Natan Rubin, Micha Sharir	A kinetic triangulation scheme for moving points in the plane.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	moving points, triangulation, convex hull, kinetic data structures
1	Eryk Kopczynski, Igor Pak, Piotr Przytycki	Acute triangulations of polyhedra and the Euclidean space.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	triangulations, polyhedra
1	Timothy M. Chan	Optimal partition trees.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	halfspace range searching, simplex range searching, geometric data structures
1	Helmut Pottmann	Discrete geometric structures for architecture.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	geometry of webs, architecture, discrete differential geometry
1	Cláudio T. Silva	Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	quadrilateral mesh processing, verifiable visualization, visualization, computer graphics
1	Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama	Distance k-sectors exist.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	distance k-sectors, knaster-tarski fixed point theorem
1	William Harvey, Yusu Wang, Rephael Wenger	A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	topology, randomized algorithms, reeb graph
1	Florian Berger, Rolf Klein	A traveller's problem.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	affine mappings, continuous dijkstra, frogger, pseudo-polynomial approximation, computational geometry, partition, np-hardness, motion planning, undecidability
1	Benjamin A. Burton	The complexity of the normal surface solution space.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	3-manifolds, normal surfaces, vertex enumeration, complexity, computational topology
1	Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow	Points with large quadrant-depth.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	depth, point set, plane
1	Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar	Linkless and flat embeddings in 3-space and the unknot problem.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	flat embedding, linkless embedding, unknot, knot
1	Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic	Consistent digital line segments.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	digital line segment, digital geometry, discrete geometry
1	Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir	The 2-center problem in three dimensions.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	2-center problem, intersection of congruent balls, multi-dimensional parametric searching, spherical polytopes, facility location, geometric optimization
1	Karl Bringmann	Klee's measure problem on fat boxes in time PARTIAL DIFFERENTIAL (n(d+2)/3).	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	union of cubes, geometric data structures
1	Sunil Arya, David M. Mount, Jian Xia	Tight lower bounds for halfspace range searching.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	lower bounds, range searching, idempotence
1	Dominique Attali, André Lieutier	Reconstructing shapes with guarantees by unions of convex sets.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	homotopy equivalence, union of convex sets, sampling, minkowski sum, shape reconstruction, offsets
1	David L. Millman, Jack Snoeyink	Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	low-degree primitives, reduced precision, robust computation, voronoi diagrams
1	Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir	Kinetic stable Delaunay graphs.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	Voronoi diagram, Delaunay triangulation, kinetic data structure
1	Gur Harary, Ayellet Tal	Visualizing 3D Euler spirals.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	Euler spirals, 3D curves
1	Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu	Dynamic well-spaced point sets.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	well-spaced point sets, dynamization, voronoi diagrams, mesh generation, self-adjusting computation, dynamic stability
1	Stephen J. Guy, Jur P. van den Berg, Ming C. Lin, Dinesh Manocha	Geometric methods for multi-agent collision avoidance.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	multi-agent motion planning, collision avoidance, crowd simulation
1	Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama	Zone diagrams in Euclidean spaces and in other normed spaces.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	knaster-tarski fixed point theorem, zone diagrams
1	Tamal K. Dey, Jian Sun 0002, Yusu Wang	Approximating loops in a shortest homology basis from point data.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	homology basis, rips complex, topology, point cloud

Publications at "Symposium on Computational Geometry"( http://dblp.L3S.de/Venues/Symposium_on_Computational_Geometry )