Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Long Lin, Chee-Keng Yap	Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach.	SCG	2009	DBLP DOI BibTeX RDF	curve approximation, exact numerical algorithm, parametrizability, topological correctness, meshing, isotopy, subdivision algorithm
1	Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler	Parallel geometric algorithms for multi-core computers.	SCG	2009	DBLP DOI BibTeX RDF	box intersection, compact container, d-dimension, spatial sort, parallel algorithms, multi-core, delaunay triangulations, geometric algorithms, kd-trees, cgal
1	Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas, Steve Oudot	Proximity of persistence modules and their diagrams.	SCG	2009	DBLP DOI BibTeX RDF	persistence diagram, topological data analysis, topological persistence, stability, discretization
1	Mohammad Ali Abam, Mark de Berg	Kinetic spanners in Rd.	SCG	2009	DBLP DOI BibTeX RDF	kinetic data structures, geometric spanners
1	Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis	Visibility maps of realistic terrains have linear smoothed complexity.	SCG	2009	DBLP DOI BibTeX RDF	realistic input, terrains, smoothed analysis, visibility maps
1	Nabil H. Mustafa, Saurabh Ray	PTAS for geometric hitting set problems via local search.	SCG	2009	DBLP DOI BibTeX RDF	approximation algorithm, local search, hitting sets, epsilon nets
1	Gunnar E. Carlsson, Vin de Silva, Dmitriy Morozov	Zigzag persistent homology and real-valued functions.	SCG	2009	DBLP DOI BibTeX RDF	Mayer-Vietoris pyramid, extended persistence, levelset zigzag, zigzag persistent homology, algorithms
1	Rom Pinchasi	Halving lines and measure concentration in the plane.	SCG	2009	DBLP DOI BibTeX RDF	halving lines, measure, points, lines
1	Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek	Rectangular cartograms: the game.	SCG	2009	DBLP DOI BibTeX RDF	game, cartograms
1	Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos	Randomly removing g handles at once.	SCG	2009	DBLP DOI BibTeX RDF	bounded genus graphs, probabilistic approximation, embeddings, planar graphs
1	Csaba D. Tóth	Binary plane partitions for disjoint line segments.	SCG	2009	DBLP DOI BibTeX RDF	line segment, binary space partition
1	Chuanjiang Luo, Jian Sun 0002, Yusu Wang 0001	Integral estimation from point cloud in d-dimensional space: a geometric view.	SCG	2009	DBLP DOI BibTeX RDF	point cloud data, approximation algorithm, data analysis, laplace-beltrami operator
1	Erin W. Chambers, Jeff Erickson 0001, Amir Nayyeri	Minimum cuts and shortest homologous cycles.	SCG	2009	DBLP DOI BibTeX RDF	computational topology, topological graph theory
1	Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser	The scale axis picture show.	SCG	2009	DBLP DOI BibTeX RDF	union of balls, skeleton, medial axis
1	Peyman Afshani, Chris H. Hamilton, Norbert Zeh	A general approach for cache-oblivious range reporting and approximate range counting.	SCG	2009	DBLP DOI BibTeX RDF	data structures, memory hierarchies, range searching, cache-obliviousness
1	Luc Habert, Michel Pocchiola	Arrangements of double pseudolines: extended abstract.	SCG	2009	DBLP DOI BibTeX RDF	double pseudolines, pseudolines, duality, convexity, arrangements, axiomatization
1	Sang Won Bae, Kyung-Yong Chwa	The geodesic farthest-site Voronoi diagram in a polygonal domain with holes.	SCG	2009	DBLP DOI BibTeX RDF	farthest-site voronoi diagram, polygonal domain, shortest obstacle-free path, tight upper bound, geodesic
1	Gill Barequet, Amir Vaxman	Straight skeletons of three-dimensional polyhedra.	SCG	2009	DBLP DOI BibTeX RDF	medial axis, straight skeleton
1	Marc J. van Kreveld, Rodrigo I. Silveira	Embedding rivers in polyhedral terrains.	SCG	2009	DBLP DOI BibTeX RDF	polyhedral terrain, river network, linear programming
1	Vin de Silva, Mikael Vejdemo-Johansson	Persistent cohomology and circular coordinates.	SCG	2009	DBLP DOI BibTeX RDF	persistent cohomology, dimensionality reduction, computational topology, persistent homology
1	Peyman Afshani, Chris H. Hamilton, Norbert Zeh	Cache-oblivious range reporting with optimal queries requires superlinear space.	SCG	2009	DBLP DOI BibTeX RDF	data structures, lower bounds, memory hierarchies, range searching, cache-obliviousness
1	Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen	Candle in the woods: asymptotic bounds on minimum blocking sets.	SCG	2009	DBLP DOI BibTeX RDF	asymptotic bounds, blocking set, farey sequences
1	Bernd Gärtner, Martin Jaggi	Coresets for polytope distance.	SCG	2009	DBLP DOI BibTeX RDF	polytope distance, support vector machines, approximation algorithms, kernel methods, sparsity, geometric optimization, coresets
1	Andrea Vattani	k-means requires exponentially many iterations even in the plane.	SCG	2009	DBLP DOI BibTeX RDF	lower bounds, k-means
1	Gary L. Miller, Donald R. Sheehy	Approximate center points with proofs.	SCG	2009	DBLP DOI BibTeX RDF	Tverberg's theorem, centerpoints, approximation algorithms, derandomization
1	Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl	Divide-and-conquer for Voronoi diagrams revisited.	SCG	2009	DBLP DOI BibTeX RDF	biarc approximation, trimmed offset, voronoi diagram, motion planning, medial axis, divide-and-conquer
1	Roel Apfelbaum, Micha Sharir	An improved bound on the number of unit area triangles.	SCG	2009	DBLP DOI BibTeX RDF	geometric incidences, repeated configurations, unit-area triangles, combinatorial geometry
1	Timothy M. Chan	A (slightly) faster algorithm for klee's measure problem.	SCG	2008	DBLP DOI BibTeX RDF	union of geometric objects, data structures, boxes
1	Frédéric Chazal, Steve Oudot	Towards persistence-based reconstruction in euclidean spaces.	SCG	2008	DBLP DOI BibTeX RDF	cech complex, manifold reconstruction, rips complex, filtration, persistent homology, witness complex
1	Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson	A simple and efficient kinetic spanner.	SCG	2008	DBLP DOI BibTeX RDF	kinetic data structures, geometric spanners
1	Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao 0001	External memory planar point location with logarithmic updates.	SCG	2008	DBLP DOI BibTeX RDF	dynamic data structure, external memory, point location, planar subdivisions
1	Hans Raj Tiwary, Khaled M. Elbassioni	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.	SCG	2008	DBLP DOI BibTeX RDF	vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality
1	Audrey Lee, Ileana Streinu, Louis Theran	Analyzing rigidity with pebble games.	SCG	2008	DBLP DOI BibTeX RDF	computational geometry, rigidity, sparse graph, pebble game
1	Krzysztof Onak, Anastasios Sidiropoulos	Circular partitions with applications to visualization and embeddings.	SCG	2008	DBLP DOI BibTeX RDF	visualization, approximation algorithms, embeddings, treemap, ultrametrics
1	Kenneth L. Clarkson	Tighter bounds for random projections of manifolds.	SCG	2008	DBLP DOI BibTeX RDF	johnson-lindenstrauss random projection
1	Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk	Maximum thick paths in static and dynamic environments.	SCG	2008	DBLP DOI BibTeX RDF	approximation algorithms, motion planning
1	Maarten Löffler, Jack Snoeyink	Delaunay triangulations of imprecise pointsin linear time after preprocessing.	SCG	2008	DBLP DOI BibTeX RDF	data imprecision, delaunay triangulation, minimum spanning tree, gabriel graph
1	Herbert Edelsbrunner, John Harer, Amit K. Patel	Reeb spaces of piecewise linear mappings.	SCG	2008	DBLP DOI BibTeX RDF	combinatorial manifolds, cone neighborhoods, reeb spaces, smooth and pl topology, algorithms, triangulations, stratifications
1	Evangelia Pyrga, Saurabh Ray	New existence proofs epsilon-nets.	SCG	2008	DBLP DOI BibTeX RDF	strong ?-nets, discrete geometry, hitting sets, hypergraph transversals
1	Efi Fogel, Ophir Setter, Dan Halperin	Arrangements of geodesic arcs on the sphere.	SCG	2008	DBLP DOI BibTeX RDF	robustness and precision, arrangements, voronoi, cgal
1	Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama	Consistent digital rays.	SCG	2008	DBLP DOI BibTeX RDF	star-shaped regions, digital geometry, discrete geometry, tree embedding
1	Frédéric Cazals, Aditya G. Parameswaran, Sylvain Pion	Robust construction of the three-dimensional flow complex.	SCG	2008	DBLP DOI BibTeX RDF	euclidean distance function, lazy constructions, surface reconstruction, cascading, morse-smale complex, medial axis approximation
1	Radoslav Fulek, Andreas F. Holmsen, János Pach	Intersecting convex sets by rays.	SCG	2008	DBLP DOI BibTeX RDF	depth in arrangements, convex sets, transversals
1	Timothy M. Chan	Dynamic coresets.	SCG	2008	DBLP DOI BibTeX RDF	approximation algorithms, randomization, dynamic data structures, geometric optimization, word ram
1	Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff 0001	Optimizing active ranges for consistent dynamic map labeling.	SCG	2008	DBLP DOI BibTeX RDF	dynamic map labeling, approximation algorithms, np-hardness
1	Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson 0001, Sylvain Lazard, Francis Lazarus, Shripad Thite	Walking your dog in the woods in polynomial time.	SCG	2008	DBLP DOI BibTeX RDF	geodesic leash map, homotopic fréchet distance
1	Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner	Schnyder woods for higher genus triangulated surfaces.	SCG	2008	DBLP DOI BibTeX RDF	graph encoding, higher genus surfaces, schnyder woods, triangulations
1	Pankaj K. Agarwal, Bardia Sadri, Hai Yu 0005	Untangling triangulations through local explorations.	SCG	2008	DBLP DOI BibTeX RDF	local surgery, mesh repair, triangulations, deformable mesh
1	Naoki Katoh, Shin-ichi Tanigawa	Fast enumeration algorithms for non-crossing geometric graphs.	SCG	2008	DBLP DOI BibTeX RDF	non-crossing geometric graphs, triangulation, enumeration
1	Mikhail Belkin, Jian Sun 0002, Yusu Wang 0001	Discrete laplace operator on meshed surfaces.	SCG	2008	DBLP DOI BibTeX RDF	surfacemesh, approximation algorithm, laplace-beltrami operator
1	Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès	Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.	SCG	2008	DBLP DOI BibTeX RDF	delta-hyperbolic space, diameter, center, radius
1	Jyh-Ming Lien	Minkowski sums of rotating convex polyhedra.	SCG	2008	DBLP DOI BibTeX RDF	kinematic algorithm, polytope, minkowski sum
1	Tamal K. Dey, Joshua A. Levine	Delpsc: a delaunay mesher for piecewise smooth complexes.	SCG	2008	DBLP DOI BibTeX RDF	non-smoothness, piecewise-smooth complexes, mesh generation, non-manifolds, delaunay refinement
1	Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen	Routing a maximum number of disks through a scene of moving obstacles.	SCG	2008	DBLP DOI BibTeX RDF	moving obstacles, approximation algorithms, motion planning, maximum throughput
1	Eric Berberich, Michael Kerber, Michael Sagraloff	Exact geometric-topological analysis of algebraic surfaces.	SCG	2008	DBLP DOI BibTeX RDF	topology computation, exact geometric computation, algebraic surfaces, cylindrical algebraic decomposition
1	Jacob Fox, János Pach	Coloring kk-free intersection graphs of geometric objects in the plane.	SCG	2008	DBLP DOI BibTeX RDF	quasi-planar, string graph, chromatic number, topological graph, intersection graph
1	Minkyoung Cho, David M. Mount	Embedding and similarity search for point sets under translation.	SCG	2008	DBLP DOI BibTeX RDF	embedding, randomized algorithms, similarity search, point pattern matching
1	Pavel Emeliyanenko, Michael Kerber	Visualizing and exploring planar algebraic arrangements: a web application.	SCG	2008	DBLP DOI BibTeX RDF	arrangements, algebraic curves, exact geometric computation, plotting
1	Bernard Chazelle, Wolfgang Johann Heinrich Mulzer	Markov incremental constructions.	SCG	2008	DBLP DOI BibTeX RDF	clarkson-shor bound, randomized incremental constructions, expander graphs
1	Monique Teillaud (eds.)	Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008	SCG	2008	DBLP DOI BibTeX RDF
1	Eitan Yaffe, Dan Halperin	Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space.	SCG	2008	DBLP DOI BibTeX RDF	alpha complex, persistence diagram, medial axis, molecular modeling
1	Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec	Locally uniform anisotropic meshing.	SCG	2008	DBLP DOI BibTeX RDF	anisotropic mesh generation, delaunay triangulation, delaunay refinement
1	Manuel Caroli, Monique Teillaud	On the computation of 3d periodic triangulations.	SCG	2008	DBLP DOI BibTeX RDF	flat torus, c++, delaunay triangulation
1	Manor Mendel, Assaf Naor	Markov convexity and local rigidity of distorted metrics.	SCG	2008	DBLP DOI BibTeX RDF	bd-ramsey, markov convexity, metric dichotomy, p-convexity, uniform convexity, tree metrics
1	Kenneth L. Clarkson, C. Seshadhri 0001	Self-improving algorithms for delaunay triangulations.	SCG	2008	DBLP DOI BibTeX RDF	delaunay triangulations
1	Sarit Buzaglo, Ron Holzman, Rom Pinchasi	On s-intersecting curves and related problems.	SCG	2008	DBLP DOI BibTeX RDF	$k$-sets, points, curves, vc-dimension, plane
1	Kenneth L. Clarkson	Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures.	SCG	2008	DBLP DOI BibTeX RDF	measure, metric, dimension, net
1	Ileana Streinu, Louis Theran	Combinatorial genericity and minimal rigidity.	SCG	2008	DBLP DOI BibTeX RDF	computational geometry, rigidity, sparse graphs
1	Erin W. Chambers, Jeff Erickson 0001, Pratik Worah	Testing contractibility in planar rips complexes.	SCG	2008	DBLP DOI BibTeX RDF	rips shadow, vietoris-rips complex, computational topology, homotopy
1	Alexander I. Bobenko	Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications.	SCG	2008	DBLP DOI BibTeX RDF	Lapace operator, dirichlet energy, flipping algorithm, Delaunay triangulation, discrete differential geometry
1	Olivier Devillers, Marc Glisse, Sylvain Lazard	Predicates for line transversals to lines and line segments in three-dimensional space.	SCG	2008	DBLP DOI BibTeX RDF	optimality, polynomial, predicate, line transversal
1	Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc	Helly-type theorems for approximate covering.	SCG	2008	DBLP DOI BibTeX RDF	3d visibility, approximate covering, helly-type theorems, lp-type problems
1	Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri	I/o-efficient efficient algorithms for computing contours on a terrain.	SCG	2008	DBLP DOI BibTeX RDF	i/o-efficient algorithms, geographical information systems, contours, terrains
1	Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood	Improved upper bounds on the crossing number.	SCG	2008	DBLP DOI BibTeX RDF	convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree
1	Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers	Hinged dissections exist.	SCG	2008	DBLP DOI BibTeX RDF	hinging, motion
1	Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein	Polychromatic colorings of plane graphs.	SCG	2008	DBLP DOI BibTeX RDF	graph coloring
1	Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir	The complexity of the outer face in arrangements of random segments.	SCG	2008	DBLP DOI BibTeX RDF	outer face complexity, walk along a line, computation geometry
1	Timothy M. Chan	On levels in arrangements of curves, iii: further improvements.	SCG	2008	DBLP DOI BibTeX RDF	k-levels, k-sets, arrangements, combinatorial geometry
1	Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth	Extremal problems on triangle areas in two and three dimensions.	SCG	2008	DBLP DOI BibTeX RDF	distinct triangle areas, extremal combinatorics, maximum triangle areas, minimum triangle areas, unit triangle areas, discrete geometry, point configurations
1	Yakov Nekrich	A data structure for multi-dimensional range reporting.	SCG	2007	DBLP DOI BibTeX RDF	orthogonal range reporting, algorithms, data structures, computational geometry
1	József Solymosi, Gábor Tardos	On the number of k-rich transformations.	SCG	2007	DBLP DOI BibTeX RDF	Möbius transformation, point-line incidences
1	Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote	New upper bounds on the quality of the PCA bounding boxes in r2 and r3.	SCG	2007	DBLP DOI BibTeX RDF	principal component analysis, bounding boxes
1	Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir	Similar simplices in a d-dimensional point set.	SCG	2007	DBLP DOI BibTeX RDF	points and hyperplanes, combinatorial geometry, incidences, repeated patterns, point configurations
1	Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski	Offline variants of the "lion and man" problem.	SCG	2007	DBLP DOI BibTeX RDF	lion and man problem, measuring crowdedness, safe path planning, survival problem
1	Esther Ezra, János Pach, Micha Sharir	On regular vertices on the union of planar objects.	SCG	2007	DBLP DOI BibTeX RDF	(1/r)-cuttings, regular vertices, union of geometric objects
1	David Eppstein	Happy endings for flip graphs.	SCG	2007	DBLP DOI BibTeX RDF	bistellar flip, empty pentagon, flip distance, flip graph, isometric embedding, partial cube, hypercube, triangulation
1	Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang 0001	Querying approximate shortest paths in anisotropic regions.	SCG	2007	DBLP DOI BibTeX RDF	data structures, computational geometry, shortest path
1	Gill Barequet, Alina Shaikhet	Heilbronn's triangle problem.	SCG	2007	DBLP DOI BibTeX RDF	extremal configurations, packing arguments
1	Mohammad Ali Abam, Mark de Berg, Bettina Speckmann	Kinetic KD-trees and longest-side KD-trees.	SCG	2007	DBLP DOI BibTeX RDF	longest-side KD-tree, kd-tree, kinetic data structures
1	Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel	Between umbra and penumbra.	SCG	2007	DBLP DOI BibTeX RDF	umbra, complexity, shadows, penumbra, discontinuity mesh
1	Erik D. Demaine, Mihai Patrascu	Tight bounds for dynamic convex hull queries (again).	SCG	2007	DBLP DOI BibTeX RDF	bounded precision, dynamic convex hull, word RAM
1	David Eppstein, Michael T. Goodrich, Nodari Sitchinava	Guard placement for efficient point-in-polygon proofs.	SCG	2007	DBLP DOI BibTeX RDF	angle guards, art gallery problem, floodlights, approximation algorithm, localization
1	Pankaj K. Agarwal, Haim Kaplan, Micha Sharir	Computing the volume of the union of cubes.	SCG	2007	DBLP DOI BibTeX RDF	union of objects, arrangements
1	Jeff Erickson 0001 (eds.)	Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007	SCG	2007	DBLP DOI BibTeX RDF
1	Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote	There are not too many magic configurations.	SCG	2007	DBLP DOI BibTeX RDF	discharging method, magic configurations
1	Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu 0005	Embeddings of surfaces, curves, and moving points in euclidean space.	SCG	2007	DBLP DOI BibTeX RDF	moving points, dimensionality reduction, random projection, doubling dimension
1	Mirela Ben-Chen, Craig Gotsman, Camille Wormser	Distributed computation of virtual coordinates.	SCG	2007	DBLP DOI BibTeX RDF	distributed computing, greedy routing, virtual coordinates, power diagrams, planar embedding
1	Gunnar E. Carlsson, Afra Zomorodian	The theory of multidimensional persistence.	SCG	2007	DBLP DOI BibTeX RDF	computational topology, persistent homology, multidimensional analysis
1	János Pach, Géza Tóth 0001	Decomposition of multiple coverings into many parts.	SCG	2007	DBLP DOI BibTeX RDF	multiple coverings, sensor networks
1	Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister	A geometric framework for solving subsequence problems in computational biology efficiently.	SCG	2007	DBLP DOI BibTeX RDF	quasiconvex functions, subsequence problems, computational biology, Minkowski sums

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