Search results for "Symposium on Computational Geometry"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jack Snoeyink, Mark de Berg, Joseph S. B. Mitchell, Günter Rot, 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	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	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	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	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	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	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	Harish Doraiswamy, Aneesh Sood, Vijay Natarajan	Constructing Reeb graphs using cylinder maps.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	level set topology, computational topology, Reeb graphs
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	Mohammad Ali Abam, Sariel Har-Peled	New constructions of SSPDs and their applications.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	separated pair decomposition, separators, geometric spanners
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	Helmut Pottmann	Discrete geometric structures for architecture.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	geometry of webs, architecture, discrete differential geometry
1	Tamal K. Dey, Jian Sun, 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
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	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	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	Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza	Improving the first selection lemma in R3.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	centerpoints, first selection lemma, hitting simplices, location depth
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	Natan Rubin	Lines avoiding balls in three dimensions revisited.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	free lines, tangency surfaces, arrangements, combinatorial complexity, lines in space
1	Bernard Chazelle	The geometry of flocking.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	bird flocking, flight net, multiagent agreement systems
1	David Eppstein, Elena Mumford	Steinitz theorems for orthogonal polyhedra.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	Steinitz theorem, orthogonal polyhedron, planar graph
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	Bernard Chazelle	A geometric approach to collective motion.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	agreement dynamics, collective motion, total s-energy
1	Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira	Computing similarity between piecewise-linear functions.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	polyhedral terrain, approximation algorithm, similarity, randomized algorithm, piecewise-linear function
1	Omid Amini, Jean-Daniel Boissonnat, Pooran Memari	Geometric tomography with topological guarantees.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	homotopy theory, reconstruction from cross sections, thopological guarantees
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Output-sensitive algorithm for the edge-width of an embedded graph.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	edge-width, embedded graph, face-width, surface, computational topology, topological graph theory
1	Benoît Hudson, Gary L. Miller, Steve Oudot, Donald Sheehy	Topological inference via meshing.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	sparse voronoi refinement, mesh generation, persistent homology, topological inference
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	György Elekes, Micha Sharir	Incidences in three dimensions and distinct distances in the plane.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	algebraic techniques, distinct distances, incidences
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Finding shortest non-trivial cycles in directed graphs on surfaces.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	embedded graph, non-contractible cycle, non-separating cycle, directed graph, surface, computational topology, topological graph theory
1	Gur Harary, Ayellet Tal	Visualizing 3D Euler spirals.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	Euler spirals, 3D curves
1	Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen	Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	orthogonal range reporting, pointer machine, data structures, lower bounds
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	Marc Glisse, Sylvain Lazard	On the complexity of sets of free lines and line segments among balls in three dimensions.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	free lines, free segments, visibility complex, balls, 3D visibility
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	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	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	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	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	Mark de Berg	Better bounds on the union complexity of locally fat objects.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	union complexity, combinatorial geometry, fat objects
1	János Pach, Andrew Suk, Miroslav Treml	Tangencies between families of disjoint regions in the plane.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	tangencies, convexity, arrangements
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	Pankaj K. Agarwal	An improved algorithm for computing the volume of the union of cubes.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	union of cubes, geometric data structures
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	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	Dominique Attali, André Lieutier	Optimal reconstruction might be hard.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	3SAT, homological simplification, sampling conditions, topological persistence, NP-completeness, shape reconstruction
1	Joachim Gudmundsson, Pat Morin	Planar visibility: testing and counting.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	visibility, geometric data structures
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	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	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	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	Jean-Daniel Boissonnat, Arijit Ghosh	Manifold reconstruction using tangential Delaunay complexes.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	manifold reconstruction, sampling conditions, sliver exudation, tangential complex, manifold learning, weighted delaunay triangulation
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	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	John Hershberger, Efi Fogel (eds.)	Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009	Symposium on Computational Geometry	2009	DBLP BibTeX RDF
1	Gill Barequet, Amir Vaxman	Straight skeletons of three-dimensional polyhedra.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	medial axis, straight skeleton
1	Peter B. Noël, Jinhui Xu, Kenneth R. Hoffmann, Jason J. Corso	Geometric tomography: a limited-view approach for computed tomography.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	geometric compressed sensing, topological peeling, computed tomography
1	Long Lin, Chee-Keng Yap	Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	curve approximation, exact numerical algorithm, parametrizability, topological correctness, meshing, isotopy, subdivision algorithm
1	Nabil H. Mustafa, Saurabh Ray	PTAS for geometric hitting set problems via local search.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithm, local search, hitting sets, epsilon nets
1	Jinsan Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas	On the topology of planar algebraic curves.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	effective algebraic geometry, topology of algebraic curves, exact geometric computation
1	Sang Won Bae, Kyung-Yong Chwa	The geodesic farthest-site Voronoi diagram in a polygonal domain with holes.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	farthest-site voronoi diagram, polygonal domain, shortest obstacle-free path, tight upper bound, geodesic
1	Robert J. Lang	Computational origami: from flapping birds to space telescopes.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	folding, origami, developable surfaces
1	Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza	An IP solution to the art gallery problem.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	integer programming, visibility, set cover, art gallery
1	Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos	Randomly removing g handles at once.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	bounded genus graphs, probabilistic approximation, embeddings, planar graphs
1	Vin de Silva, Mikael Vejdemo-Johansson	Persistent cohomology and circular coordinates.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	persistent cohomology, dimensionality reduction, computational topology, persistent homology
1	Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus	Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	Delaunay graph, Delaunay triangulation
1	Roel Apfelbaum, Micha Sharir	An improved bound on the number of unit area triangles.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	geometric incidences, repeated configurations, unit-area triangles, combinatorial geometry
1	Andrea Vattani	k-means requires exponentially many iterations even in the plane.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	lower bounds, k-means
1	Matthew T. Dickerson, David Eppstein	Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions).	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	two-site distance functions, complexity, animation, Voronoi diagrams
1	Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt	Distributed vision with smart pixels.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	distributed vision, sweepline algorithms, distributed algorithms, principle component analysis, sublinear algorithms
1	Gunnar Carlsson, Vin de Silva, Dmitriy Morozov	Zigzag persistent homology and real-valued functions.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	Mayer-Vietoris pyramid, extended persistence, levelset zigzag, zigzag persistent homology, algorithms
1	Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser	The scale axis picture show.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	union of balls, skeleton, medial axis
1	Nader Salman, Mariette Yvinec	High resolution surface reconstruction from overlapping multiple-views.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	cimg, restricted delaunay triangulation, triangle soup, surface reconstruction, multiple-views, delaunay refinement, cgal
1	David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek	Area-universal rectangular layouts.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	rectangular layouts
1	Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ramaswami	Quadrilateral meshes with bounded minimum angle.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	quadrilateral mesh generation
1	Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk	On grids in topological graphs.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	tur?n-type problems, grids, geometric graphs, topological graphs
1	Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl	Divide-and-conquer for Voronoi diagrams revisited.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	biarc approximation, trimmed offset, voronoi diagram, motion planning, medial axis, divide-and-conquer
1	Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas, Steve Oudot	Proximity of persistence modules and their diagrams.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	persistence diagram, topological data analysis, topological persistence, stability, discretization
1	Francis Y. L. Chin, Zeyu Guo, He Sun	Minimum Manhattan network is NP-complete.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	3-sat, minimum Manhattan network, NP-complete
1	Timothy M. Chan, Sariel Har-Peled	Approximation algorithms for maximum independent set of pseudo-disks.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation., local search
1	Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled	On the set multi-cover problem in geometric settings.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	set cover, cuttings, LP rounding
1	Joseph S. B. Mitchell, Eli Packer	Reconstructing sharp features of triangular meshes.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	surface reconstruction, triangulation, algebraic curves, sharp features
1	Naoki Katoh, Shin-ichi Tanigawa	A proof of the molecular conjecture.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity
1	Bernard Chazelle, Wolfgang Mulzer	Computing hereditary convex structures.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	half-space range searching, hereditary convex hulls, convex polytope
1	Rom Pinchasi	Halving lines and measure concentration in the plane.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	halving lines, measure, points, lines
1	Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß	Diameter of polyhedra: limits of abstraction.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	disjoint coverings, hirsch conjecture, polyhedra, convex geometry
1	Luc Habert, Michel Pocchiola	Arrangements of double pseudolines: extended abstract.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	double pseudolines, pseudolines, duality, convexity, arrangements, axiomatization
1	Tamal K. Dey, Kuiyu Li	Cut locus and topology from surface point data.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	cut locus, rips complex, surface point cloud, topology, differential geometry
1	Gary L. Miller, Donald Sheehy	Approximate center points with proofs.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	Tverberg's theorem, centerpoints, approximation algorithms, derandomization
1	Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler	Parallel geometric algorithms for multi-core computers.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	box intersection, compact container, d-dimension, spatial sort, parallel algorithms, delaunay triangulations, multi-core, geometric algorithms, kd-trees, cgal
1	Boris Bukh, Jirí Matousek, Gabriel Nivasch	Lower bounds for weak epsilon-nets and stair-convexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net
1	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-linear approximation algorithms for geometric hitting sets.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets
1	Timothy M. Chan, Eric Y. Chen	Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	in-place algorithms, segment intersection, voronoi diagrams, convex hulls, cache-oblivious algorithms
1	Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser	The scale axis transform.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	topology, skeleton, medial axis
1	Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis	Visibility maps of realistic terrains have linear smoothed complexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	realistic input, terrains, smoothed analysis, visibility maps
1	Marc J. van Kreveld, Rodrigo I. Silveira	Embedding rivers in polyhedral terrains.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	polyhedral terrain, river network, linear programming
1	Kasturi R. Varadarajan	Epsilon nets and union complexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithms, set cover, epsilon nets
1	Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek	Rectangular cartograms: the game.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	game, cartograms
1	Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth	Shooting permanent rays among disjoint polygons in the plane.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	convex partition, segment insertion, dynamic data structure, ray shooting, binary space partition

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