Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Peyman Afshani	Improved pointer machine and I/O lower bounds for simplex range reporting and related problems.	SCG	2012	DBLP DOI BibTeX RDF
1	Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos	How to walk your dog in the mountains with no magic leash.	SCG	2012	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh	Stability of Delaunay-type structures for manifolds: [extended abstract].	SCG	2012	DBLP DOI BibTeX RDF
1	Salman Parsa	A deterministic o(m log m) time algorithm for the reeb graph.	SCG	2012	DBLP DOI BibTeX RDF
1	Amirali Abdullah, John Moeller, Suresh Venkatasubramanian	Approximate bregman near neighbors in sublinear time: beyond the triangle inequality.	SCG	2012	DBLP DOI BibTeX RDF
1	Christopher J. Bishop	Mappings and meshes.	SCG	2012	DBLP DOI BibTeX RDF
1	Peyman Afshani, Lars Arge, Kasper Green Larsen	Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model.	SCG	2012	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Jiongxin Jin, Man-Kit Lau	A fast and simple surface reconstruction algorithm.	SCG	2012	DBLP DOI BibTeX RDF
1	Jens M. Schmidt, Pavel Valtr 0001	Cubic plane graphs on a given point set.	SCG	2012	DBLP DOI BibTeX RDF
1	Jeff Erickson 0001, Amir Nayyeri	Tracing compressed curves in triangulated surfaces.	SCG	2012	DBLP DOI BibTeX RDF
1	Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri 0001	Self-improving algorithms for coordinate-wise maxima.	SCG	2012	DBLP DOI BibTeX RDF
1	Kasper Green Larsen, Huy Le Nguyen	Improved range searching lower bounds.	SCG	2012	DBLP DOI BibTeX RDF
1	Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos 0001, Gelasio Salazar	The 2-page crossing number of Kn.	SCG	2012	DBLP DOI BibTeX RDF
1	Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa	Periodic body-and-bar frameworks.	SCG	2012	DBLP DOI BibTeX RDF
1	Victor Alvarez 0001, Karl Bringmann, Radu Curticapean, Saurabh Ray	Counting crossing-free structures.	SCG	2012	DBLP DOI BibTeX RDF
1	Abhijin Adiga, L. Sunil Chandran	Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions.	SCG	2012	DBLP DOI BibTeX RDF
1	Dror Atariah, Günter Rote	Configuration space visualization.	SCG	2012	DBLP DOI BibTeX RDF
1	Johan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J. T. Jones, Monique Teillaud	The sticky geometry of the cosmic web.	SCG	2012	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Michael Kerber	Alexander duality for functions: the persistent behavior of land and water and shore.	SCG	2012	DBLP DOI BibTeX RDF
1	Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier	On sub-determinants and the diameter of polyhedra.	SCG	2012	DBLP DOI BibTeX RDF
1	Therese Biedl, Martin Vatshelle	The point-set embeddability problem for plane graphs.	SCG	2012	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote	Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions.	SCG	2012	DBLP DOI BibTeX RDF
1	Timothy M. Chan	Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set.	SCG	2012	DBLP DOI BibTeX RDF
1	Anne Driemel, Sariel Har-Peled, Benjamin Raichel	On the expected complexity of voronoi diagrams on terrains.	SCG	2012	DBLP DOI BibTeX RDF
1	Donald R. Sheehy	Linear-size approximations to the vietoris-rips filtration.	SCG	2012	DBLP DOI BibTeX RDF
1	Fatemeh Abbasinejad, Pushkar Joshi, Nina Amenta	Surface patches from unorganized space curves.	SCG	2012	DBLP DOI BibTeX RDF
1	Marek Eliás 0001, Jirí Matousek 0001	Higher-order Erdos-Szekeres theorems.	SCG	2012	DBLP DOI BibTeX RDF
1	Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee	Approximating low-dimensional coverage problems.	SCG	2012	DBLP DOI BibTeX RDF
1	Alina Ene, Sariel Har-Peled, Benjamin Raichel	Geometric packing under non-uniform constraints.	SCG	2012	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda	An output-sensitive algorithm for computing projections of resultant polytopes.	SCG	2012	DBLP DOI BibTeX RDF
1	Jane S. Richardson, David C. Richardson	Protein molecules in 3D: complex behavior from simple local geometry plus weak interactions.	SCG	2012	DBLP DOI BibTeX RDF
1	Guillermo D. Cañas, Steven J. Gortler	Duals of orphan-free anisotropic voronoi diagrams are embedded meshes.	SCG	2012	DBLP DOI BibTeX RDF
1	Micha Sharir, Adam Sheffer, Emo Welzl	Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique.	SCG	2012	DBLP DOI BibTeX RDF
1	John Christopher Bowers, Ileana Streinu	Lang's universal molecule algorithm.	SCG	2012	DBLP DOI BibTeX RDF
1	Arnaud de Mesmay, Éric Colin de Verdière	Testing graph isotopies on surfaces.	SCG	2012	DBLP DOI BibTeX RDF
1	Nabil H. Mustafa, Saurabh Ray	A theorem of bárány revisited and extended.	SCG	2012	DBLP DOI BibTeX RDF
1	Hakan Yildiz, Subhash Suri	On Klee's measure problem for grounded boxes.	SCG	2012	DBLP DOI BibTeX RDF
1	Yufei Tao 0001	Stabbing horizontal segments with vertical rays.	SCG	2012	DBLP DOI BibTeX RDF
1	Anna Gundert, Uli Wagner 0001	On laplacians of random complexes.	SCG	2012	DBLP DOI BibTeX RDF
1	Andrew Suk	Disjoint edges in complete topological graphs.	SCG	2012	DBLP DOI BibTeX RDF
1	Jacob Fox, János Pach	String graphs and incomparability graphs.	SCG	2012	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Sue Whitesides (eds.)	Proceedings of the 28th ACM Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012	SCG	2012	DBLP DOI BibTeX RDF
1	Natan Rubin	On topological changes in the delaunay triangulation of moving points.	SCG	2012	DBLP DOI BibTeX RDF
1	Michal Adamaszek, Juraj Stacho	Algorithmic complexity of finding cross-cycles in flag complexes.	SCG	2012	DBLP DOI BibTeX RDF
1	Wolfgang Mulzer, Daniel Werner	Approximating Tverberg points in linear time for any fixed dimension.	SCG	2012	DBLP DOI BibTeX RDF
1	Haim Kaplan, Micha Sharir	Finding the maximal empty disk containing a query point.	SCG	2012	DBLP DOI BibTeX RDF
1	Sunil Arya, Guilherme Dias da Fonseca, David M. Mount	Optimal area-sensitive bounds for polytope approximation.	SCG	2012	DBLP DOI BibTeX RDF
1	Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann 0001, Stephen G. Kobourov, Torsten Ueckerdt	Computing cartograms with optimal complexity.	SCG	2012	DBLP DOI BibTeX RDF
1	Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap	Certified computation of planar morse-smale complexes.	SCG	2012	DBLP DOI BibTeX RDF
1	Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc	Multinerves and helly numbers of acyclic families.	SCG	2012	DBLP DOI BibTeX RDF
1	Rien van de Weygaert	Tessellation analysis of the cosmic web.	SCG	2012	DBLP DOI BibTeX RDF
1	Joseph M. Burdis, Irina A. Kogan	Object-image correspondence for curves under central and parallel projections.	SCG	2012	DBLP DOI BibTeX RDF
1	Vít Jelínek, Jan Kratochvíl, Ignaz Rutter	A kuratowski-type theorem for planarity of partially embedded graphs.	SCG	2011	DBLP DOI BibTeX RDF
1	Jack Snoeyink, Vishal Verma	Fitting spheres to electron density.	SCG	2011	DBLP DOI BibTeX RDF
1	Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell	Guarding polyominoes.	SCG	2011	DBLP DOI BibTeX RDF
1	Ge Xia	Improved upper bound on the stretch factor of delaunay triangulations.	SCG	2011	DBLP DOI BibTeX RDF
1	Esther Ezra, Wolfgang Mulzer	Convex hull of imprecise points in o(n log n) time after preprocessing.	SCG	2011	DBLP DOI BibTeX RDF
1	Ross S. Purves	Answering geographic questions with user generated content: experiences from the coal face.	SCG	2011	DBLP DOI BibTeX RDF
1	Alexander Gilbers, Rolf Klein	A new upper bound for the VC-dimension of visibility regions.	SCG	2011	DBLP DOI BibTeX RDF
1	Sariel Har-Peled, Benjamin Raichel	The frechet distance revisited and extended.	SCG	2011	DBLP DOI BibTeX RDF
1	Manuel Caroli, Monique Teillaud	Delaunay triangulations of point sets in closed euclidean d-manifolds.	SCG	2011	DBLP DOI BibTeX RDF
1	Nicolas Chevallier, Yvan Maillot	Boundary of a non-uniform point cloud for reconstruction: extended abstract.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Nikola Milosavljevic, Dmitriy Morozov, Primoz Skraba	Zigzag persistent homology in matrix multiplication time.	SCG	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	SCG	2011	DBLP DOI BibTeX RDF
1	Vida Dujmovic, Stefan Langerman	A center transversal theorem for hyperplanes and applications to graph drawing.	SCG	2011	DBLP DOI BibTeX RDF
1	Tobias Müller 0001, Erik Jan van Leeuwen, Jan van Leeuwen	Integer representations of convex polygon intersection graphs.	SCG	2011	DBLP DOI BibTeX RDF
1	Ross J. Kang, Tobias Müller 0001	Sphere and dot product representations of graphs.	SCG	2011	DBLP DOI BibTeX RDF
1	Dominique Attali, André Lieutier, David Salinas	Efficient data structure for representing and simplifying simplicial complexes in high dimensions.	SCG	2011	DBLP DOI BibTeX RDF
1	Stefan Felsner, Mathew C. Francis	Contact representations of planar graphs with cubes.	SCG	2011	DBLP DOI BibTeX RDF
1	Pegah Kamousi, Timothy M. Chan, Subhash Suri	Stochastic minimum spanning trees in euclidean spaces.	SCG	2011	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, Quentin Mérigot, Dmitriy Morozov	Witnessed k-distance.	SCG	2011	DBLP DOI BibTeX RDF
1	Boris Bukh, Alfredo Hubard	Space crossing numbers.	SCG	2011	DBLP DOI BibTeX RDF
1	Eric Berberich, Michael Hemmer, Michael Kerber	A generic algebraic kernel for non-linear geometric applications.	SCG	2011	DBLP DOI BibTeX RDF
1	Ciprian Borcea, Ileana Streinu	Exact workspace boundary by extremal reaches.	SCG	2011	DBLP DOI BibTeX RDF
1	Chao Chen 0012, Michael Kerber	An output-sensitive algorithm for persistent homology.	SCG	2011	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Thomas Mølhave, Hai Yu 0005, James S. Clark	Exploiting temporal coherence in forest dynamics simulation.	SCG	2011	DBLP DOI BibTeX RDF
1	Umut A. Acar, Benoît Hudson, Duru Türkoglu	Kinetic mesh refinement in 2D.	SCG	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).	SCG	2011	DBLP DOI BibTeX RDF
1	Olivier Devillers, Pedro Machado Manhães de Castro	A pedagogic JavaScript program for point location strategies.	SCG	2011	DBLP DOI BibTeX RDF
1	Uli Wagner 0001	Minors in random and expanding hypergraphs.	SCG	2011	DBLP DOI BibTeX RDF
1	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal 0001	The euclidean bottleneck steiner path problem.	SCG	2011	DBLP DOI BibTeX RDF
1	Benjamin A. Burton	The pachner graph and the simplification of 3-sphere triangulations.	SCG	2011	DBLP DOI BibTeX RDF
1	John Iacono	A static optimality transformation with applications to planar point location.	SCG	2011	DBLP DOI BibTeX RDF
1	Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth	Disjoint compatible geometric matchings.	SCG	2011	DBLP DOI BibTeX RDF
1	A. Karim Abu-Affash	On the euclidean bottleneck full Steiner tree problem.	SCG	2011	DBLP DOI BibTeX RDF
1	Attila Gyulassy, Joshua A. Levine, Valerio Pascucci	Visualization of discrete gradient construction.	SCG	2011	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Yusu Wang 0001	Reeb graphs: approximation and persistence.	SCG	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.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Daniel Reem	The geometric stability of voronoi diagrams with respect to small changes of the sites.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Gary L. Miller, Todd Phillips, Don Sheehy	Beating the spread: time-optimal point meshing.	SCG	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.	SCG	2011	DBLP DOI BibTeX RDF
1	Stefan Huber 0001, Martin Held	Theoretical and practical results on straight skeletons of planar straight-line graphs.	SCG	2011	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu	Orthogonal range searching on the RAM, revisited.	SCG	2011	DBLP DOI BibTeX RDF
1	Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier	Covering cubes and the closest vector problem.	SCG	2011	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Jiongxin Jin	Edge flips and deforming surface meshes.	SCG	2011	DBLP DOI BibTeX RDF
1	Mridul Aanjaneya, Frédéric Chazal, Daniel Chen 0003, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov	Metric graph reconstruction from noisy data.	SCG	2011	DBLP DOI BibTeX RDF
1	Mark de Berg, Marcel Roeloffzen, Bettina Speckmann	Kinetic convex hulls and delaunay triangulations in the black-box model.	SCG	2011	DBLP DOI BibTeX RDF

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