Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	René Brandenberg, Stefan König 0003	No dimension independent core-sets for containment under homothetics.	SCG	2011	DBLP DOI BibTeX RDF
1	Timothy M. Chan	Three problems about dynamic convex hulls.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Jeff Erickson 0001	Shortest non-trivial cycles in directed surface graphs.	SCG	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.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Rishi Gupta, Piotr Indyk, Eric Price 0001, Yaron Rachlin	Compressive sensing with local geometric features.	SCG	2011	DBLP DOI BibTeX RDF
1	Dominique Attali, André Lieutier, David Salinas	Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes.	SCG	2011	DBLP DOI BibTeX RDF
1	Ciprian Borcea, Ileana Streinu	Extremal reaches in polynomial time.	SCG	2011	DBLP DOI BibTeX RDF
1	Gadi Aleksandrowicz, Gill Barequet	Redelmeier's algorithm for counting lattice animals.	SCG	2011	DBLP DOI BibTeX RDF
1	Christophe Weibel, Linqiao Zhang	Minimum perimeter convex hull of imprecise points in convex regions.	SCG	2011	DBLP DOI BibTeX RDF
1	Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova	Deconstructing approximate offsets.	SCG	2011	DBLP DOI BibTeX RDF
1	Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba	Persistence-based clustering in riemannian manifolds.	SCG	2011	DBLP DOI BibTeX RDF
1	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets.	SCG	2011	DBLP DOI BibTeX RDF
1	Paul Accisano, Alper Üngör	Geometric computation with smart pixels.	SCG	2011	DBLP DOI BibTeX RDF
1	Seth Pettie	On the structure and composition of forbidden sequences, with geometric applications.	SCG	2011	DBLP DOI BibTeX RDF
1	John Hershberger 0001	Stable snap rounding.	SCG	2011	DBLP DOI BibTeX RDF
1	Keiko Imai, Akitoshi Kawamura, Jirí Matousek 0001, Daniel Reem, Takeshi Tokuyama	Distance k-sectors exist.	SCG	2010	DBLP DOI BibTeX RDF	distance k-sectors, knaster-tarski fixed point theorem
1	Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu	Dynamic well-spaced point sets.	SCG	2010	DBLP DOI BibTeX RDF	well-spaced point sets, dynamization, voronoi diagrams, mesh generation, self-adjusting computation, dynamic stability
1	Tamal K. Dey, Jian Sun 0002, Yusu Wang 0001	Approximating loops in a shortest homology basis from point data.	SCG	2010	DBLP DOI BibTeX RDF	homology basis, rips complex, topology, point cloud
1	Micha Sharir, Adam Sheffer, Emo Welzl	On degrees in random triangulations of point sets.	SCG	2010	DBLP DOI BibTeX RDF	crossing-free geometric graphs, degree sequences, number of triangulatons, random triangulations, counting, charging, plane graphs
1	Marc Glisse, Sylvain Lazard	On the complexity of sets of free lines and line segments among balls in three dimensions.	SCG	2010	DBLP DOI BibTeX RDF	3D visibility, free lines, free segments, visibility complex, balls
1	Cláudio T. Silva	Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization.	SCG	2010	DBLP DOI BibTeX RDF	quadrilateral mesh processing, verifiable visualization, visualization, computer graphics
1	Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic	Consistent digital line segments.	SCG	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.	SCG	2010	DBLP DOI BibTeX RDF	2-center problem, intersection of congruent balls, multi-dimensional parametric searching, spherical polytopes, facility location, geometric optimization
1	Eryk Kopczynski, Igor Pak, Piotr Przytycki	Acute triangulations of polyhedra and the Euclidean space.	SCG	2010	DBLP DOI BibTeX RDF	triangulations, polyhedra
1	Joseph S. B. Mitchell	A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.	SCG	2010	DBLP DOI BibTeX RDF	approximation algorithm, TSP
1	Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira	Computing similarity between piecewise-linear functions.	SCG	2010	DBLP DOI BibTeX RDF	polyhedral terrain, approximation algorithm, randomized algorithm, similarity, piecewise-linear function
1	William Harvey 0001, Yusu Wang 0001, Rephael Wenger	A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes.	SCG	2010	DBLP DOI BibTeX RDF	topology, randomized algorithms, reeb graph
1	Pankaj K. Agarwal	An improved algorithm for computing the volume of the union of cubes.	SCG	2010	DBLP DOI BibTeX RDF	union of cubes, geometric data structures
1	Dominique Attali, André Lieutier	Reconstructing shapes with guarantees by unions of convex sets.	SCG	2010	DBLP DOI BibTeX RDF	homotopy equivalence, union of convex sets, sampling, minkowski sum, shape reconstruction, offsets
1	Abdul Basit 0001, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza	Improving the first selection lemma in R3.	SCG	2010	DBLP DOI BibTeX RDF	centerpoints, first selection lemma, hitting simplices, location depth
1	Harish Doraiswamy, Aneesh Sood, Vijay Natarajan	Constructing Reeb graphs using cylinder maps.	SCG	2010	DBLP DOI BibTeX RDF	level set topology, computational topology, Reeb graphs
1	David L. Millman, Jack Snoeyink	Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design.	SCG	2010	DBLP DOI BibTeX RDF	low-degree primitives, reduced precision, robust computation, voronoi diagrams
1	Stephen J. Guy, Jur P. van den Berg, Ming C. Lin, Dinesh Manocha	Geometric methods for multi-agent collision avoidance.	SCG	2010	DBLP DOI BibTeX RDF	multi-agent motion planning, collision avoidance, crowd simulation
1	Adrian Dumitrescu, Evan Hilscher	Convexification of polygons by length preserving transformations.	SCG	2010	DBLP DOI BibTeX RDF	edge-length preserving transformation, polygon convexification, discrete geometry
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Output-sensitive algorithm for the edge-width of an embedded graph.	SCG	2010	DBLP DOI BibTeX RDF	edge-width, embedded graph, face-width, surface, computational topology, topological graph theory
1	Helmut Pottmann	Discrete geometric structures for architecture.	SCG	2010	DBLP DOI BibTeX RDF	geometry of webs, architecture, discrete differential geometry
1	Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy	Topological inference via meshing.	SCG	2010	DBLP DOI BibTeX RDF	sparse voronoi refinement, mesh generation, persistent homology, topological inference
1	Pankaj K. Agarwal, Jie Gao 0001, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir	Kinetic stable Delaunay graphs.	SCG	2010	DBLP DOI BibTeX RDF	Voronoi diagram, Delaunay triangulation, kinetic data structure
1	Afra Zomorodian	The tidy set: a minimal simplicial set for computing homology of clique complexes.	SCG	2010	DBLP DOI BibTeX RDF	simplicial set, vietoris-rips complex, computational topology, witness complex
1	Natan Rubin	Lines avoiding balls in three dimensions revisited.	SCG	2010	DBLP DOI BibTeX RDF	free lines, tangency surfaces, arrangements, combinatorial complexity, lines in space
1	Florian Berger, Rolf Klein	A traveller's problem.	SCG	2010	DBLP DOI BibTeX RDF	affine mappings, continuous dijkstra, frogger, pseudo-polynomial approximation, computational geometry, partition, np-hardness, motion planning, undecidability
1	Joachim Gudmundsson, Pat Morin	Planar visibility: testing and counting.	SCG	2010	DBLP DOI BibTeX RDF	visibility, geometric data structures
1	Dominique Attali, André Lieutier	Optimal reconstruction might be hard.	SCG	2010	DBLP DOI BibTeX RDF	3SAT, homological simplification, sampling conditions, topological persistence, NP-completeness, shape reconstruction
1	Sergio Cabello, Bojan Mohar	Adding one edge to planar graphs makes crossing number hard.	SCG	2010	DBLP DOI BibTeX RDF	NP-hard, graph drawing, planar graphs, graph embedding, crossing number, topological graph theory
1	Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow	Points with large quadrant-depth.	SCG	2010	DBLP DOI BibTeX RDF	depth, point set, plane
1	Bernard Chazelle	A geometric approach to collective motion.	SCG	2010	DBLP DOI BibTeX RDF	agreement dynamics, collective motion, total s-energy
1	Mohammad Ali Abam, Sariel Har-Peled	New constructions of SSPDs and their applications.	SCG	2010	DBLP DOI BibTeX RDF	separated pair decomposition, separators, geometric spanners
1	Timothy M. Chan	Optimal partition trees.	SCG	2010	DBLP DOI BibTeX RDF	halfspace range searching, simplex range searching, geometric data structures
1	Akitoshi Kawamura, Jirí Matousek 0001, Takeshi Tokuyama	Zone diagrams in Euclidean spaces and in other normed spaces.	SCG	2010	DBLP DOI BibTeX RDF	knaster-tarski fixed point theorem, zone diagrams
1	David Eppstein, Elena Mumford	Steinitz theorems for orthogonal polyhedra.	SCG	2010	DBLP DOI BibTeX RDF	Steinitz theorem, orthogonal polyhedron, planar graph
1	Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar	Linkless and flat embeddings in 3-space and the unknot problem.	SCG	2010	DBLP DOI BibTeX RDF	flat embedding, linkless embedding, unknot, knot
1	Karl Bringmann	Klee's measure problem on fat boxes in time PARTIAL DIFFERENTIAL (n(d+2)/3).	SCG	2010	DBLP DOI BibTeX RDF	union of cubes, geometric data structures
1	Mark de Berg	Better bounds on the union complexity of locally fat objects.	SCG	2010	DBLP DOI BibTeX RDF	union complexity, combinatorial geometry, fat objects
1	Jean-Daniel Boissonnat, Arijit Ghosh	Manifold reconstruction using tangential Delaunay complexes.	SCG	2010	DBLP DOI BibTeX RDF	manifold reconstruction, sampling conditions, sliver exudation, tangential complex, manifold learning, weighted delaunay triangulation
1	Lars Arge, Morten Revsbæk, Norbert Zeh	I/O-efficient computation of water flow across a terrain.	SCG	2010	DBLP DOI BibTeX RDF	i/o-efficient algorithms, geographical information systems, terrains
1	Omid Amini, Jean-Daniel Boissonnat, Pooran Memari	Geometric tomography with topological guarantees.	SCG	2010	DBLP DOI BibTeX RDF	homotopy theory, reconstruction from cross sections, thopological guarantees
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Finding shortest non-trivial cycles in directed graphs on surfaces.	SCG	2010	DBLP DOI BibTeX RDF	embedded graph, non-contractible cycle, non-separating cycle, directed graph, surface, computational topology, topological graph theory
1	Bernard Chazelle	The geometry of flocking.	SCG	2010	DBLP DOI BibTeX RDF	bird flocking, flight net, multiagent agreement systems
1	György Elekes, Micha Sharir	Incidences in three dimensions and distinct distances in the plane.	SCG	2010	DBLP DOI BibTeX RDF	algebraic techniques, distinct distances, incidences
1	Dmitry N. Krasnoshchekov, Valentin Polishchuk, Arto Vihavainen	Shape approximation using k-order alpha-hulls.	SCG	2010	DBLP DOI BibTeX RDF	shape reconstruction
1	Gur Harary, Ayellet Tal	Visualizing 3D Euler spirals.	SCG	2010	DBLP DOI BibTeX RDF	Euler spirals, 3D curves
1	David M. Mount, Eunhui Park	A dynamic data structure for approximate range searching.	SCG	2010	DBLP DOI BibTeX RDF	approximation algorithms, quadtrees, range searching, dynamic data structures, geometric data structures
1	Sunil Arya, David M. Mount, Jian Xia	Tight lower bounds for halfspace range searching.	SCG	2010	DBLP DOI BibTeX RDF	lower bounds, range searching, idempotence
1	Anne Driemel, Sariel Har-Peled, Carola Wenk	Approximating the Fréchet distance for realistic curves in near linear time.	SCG	2010	DBLP DOI BibTeX RDF	frechet distance, realistic input models, approximation algorithms
1	Haim Kaplan, Natan Rubin, Micha Sharir	A kinetic triangulation scheme for moving points in the plane.	SCG	2010	DBLP DOI BibTeX RDF	moving points, triangulation, convex hull, kinetic data structures
1	Benjamin A. Burton	The complexity of the normal surface solution space.	SCG	2010	DBLP DOI BibTeX RDF	3-manifolds, normal surfaces, vertex enumeration, complexity, computational topology
1	János Pach, Andrew Suk, Miroslav Treml	Tangencies between families of disjoint regions in the plane.	SCG	2010	DBLP DOI BibTeX RDF	tangencies, convexity, arrangements
1	Gur Harary, Ayellet Tal	3D Euler spirals for 3D curve completion.	SCG	2010	DBLP DOI BibTeX RDF	euler spirals, 3D curves
1	David G. Kirkpatrick, Joseph S. B. Mitchell (eds.)	Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010	SCG	2010	DBLP DOI BibTeX RDF
1	Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen	Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.	SCG	2010	DBLP DOI BibTeX RDF	orthogonal range reporting, pointer machine, data structures, lower bounds
1	Peter B. Noël, Jinhui Xu 0001, Kenneth R. Hoffmann, Jason J. Corso	Geometric tomography: a limited-view approach for computed tomography.	SCG	2009	DBLP DOI BibTeX RDF	geometric compressed sensing, topological peeling, computed tomography
1	David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek	Area-universal rectangular layouts.	SCG	2009	DBLP DOI BibTeX RDF	rectangular layouts
1	Kasturi R. Varadarajan	Epsilon nets and union complexity.	SCG	2009	DBLP DOI BibTeX RDF	approximation algorithms, set cover, epsilon nets
1	Scott Hine, F. Betül Atalay, Dianna Xu, Suneeta Ramaswami	Quadrilateral meshes with bounded minimum angle.	SCG	2009	DBLP DOI BibTeX RDF	quadrilateral mesh generation
1	Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt 0001	Distributed vision with smart pixels.	SCG	2009	DBLP DOI BibTeX RDF	distributed vision, sweepline algorithms, distributed algorithms, principle component analysis, sublinear algorithms
1	Francis Y. L. Chin, Zeyu Guo 0001, He Sun 0001	Minimum Manhattan network is NP-complete.	SCG	2009	DBLP DOI BibTeX RDF	3-sat, minimum Manhattan network, NP-complete
1	Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk	On grids in topological graphs.	SCG	2009	DBLP DOI BibTeX RDF	tur?n-type problems, grids, geometric graphs, topological graphs
1	Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus	Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension.	SCG	2009	DBLP DOI BibTeX RDF	Delaunay graph, Delaunay triangulation
1	Joseph S. B. Mitchell, Eli Packer	Reconstructing sharp features of triangular meshes.	SCG	2009	DBLP DOI BibTeX RDF	surface reconstruction, triangulation, algebraic curves, sharp features
1	Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß	Diameter of polyhedra: limits of abstraction.	SCG	2009	DBLP DOI BibTeX RDF	disjoint coverings, hirsch conjecture, polyhedra, convex geometry
1	Robert J. Lang	Computational origami: from flapping birds to space telescopes.	SCG	2009	DBLP DOI BibTeX RDF	folding, developable surfaces, origami
1	Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch	Lower bounds for weak epsilon-nets and stair-convexity.	SCG	2009	DBLP DOI BibTeX RDF	inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net
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).	SCG	2009	DBLP DOI BibTeX RDF	two-site distance functions, complexity, animation, Voronoi diagrams
1	Timothy M. Chan, Eric Y. Chen	Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection.	SCG	2009	DBLP DOI BibTeX RDF	in-place algorithms, segment intersection, voronoi diagrams, convex hulls, cache-oblivious algorithms
1	Nader Salman, Mariette Yvinec	High resolution surface reconstruction from overlapping multiple-views.	SCG	2009	DBLP DOI BibTeX RDF	cimg, restricted delaunay triangulation, triangle soup, surface reconstruction, multiple-views, delaunay refinement, cgal
1	Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth	Shooting permanent rays among disjoint polygons in the plane.	SCG	2009	DBLP DOI BibTeX RDF	convex partition, segment insertion, dynamic data structure, binary space partition, ray shooting
1	Timothy M. Chan, Sariel Har-Peled	Approximation algorithms for maximum independent set of pseudo-disks.	SCG	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.	SCG	2009	DBLP DOI BibTeX RDF	set cover, cuttings, LP rounding
1	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-linear approximation algorithms for geometric hitting sets.	SCG	2009	DBLP DOI BibTeX RDF	geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets
1	Gaiane Panina, Ileana Streinu	Flattening single-vertex origami: the non-expansive case.	SCG	2009	DBLP DOI BibTeX RDF	expansive motion, spherical geometry, computational geometry, folding, origami, pseudo-triangulation
1	Naoki Katoh, Shin-ichi Tanigawa	A proof of the molecular conjecture.	SCG	2009	DBLP DOI BibTeX RDF	bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity
1	Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza	An IP solution to the art gallery problem.	SCG	2009	DBLP DOI BibTeX RDF	integer programming, visibility, set cover, art gallery
1	Andrea Francke, Michael Hoffmann 0001	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	SCG	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
1	John Hershberger 0001, Efi Fogel (eds.)	Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009	SCG	2009	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Wolfgang Mulzer	Computing hereditary convex structures.	SCG	2009	DBLP DOI BibTeX RDF	half-space range searching, hereditary convex hulls, convex polytope
1	Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser	The scale axis transform.	SCG	2009	DBLP DOI BibTeX RDF	topology, skeleton, medial axis
1	Tamal K. Dey, Kuiyu Li	Cut locus and topology from surface point data.	SCG	2009	DBLP DOI BibTeX RDF	cut locus, rips complex, surface point cloud, topology, differential geometry
1	Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas	On the topology of planar algebraic curves.	SCG	2009	DBLP DOI BibTeX RDF	effective algebraic geometry, topology of algebraic curves, exact geometric computation

Publications at "SCG"( http://dblp.L3S.de/Venues/SCG )