Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Adrian Dumitrescu	On distinct distances from a vertex of a convex polygon.	SCG	2004	DBLP DOI BibTeX RDF	distinct distances, convex polygons
1	Bohdan Kaluzny, Komei Fukuda	The criss-cross method can take Omega(nd) pivots.	SCG	2004	DBLP DOI BibTeX RDF	deformed products, long paths, linear programming, polyhedra, pivot rules
1	Joseph S. B. Mitchell, Micha Sharir	New results on shortest paths in three dimensions.	SCG	2004	DBLP DOI BibTeX RDF	shortest path, NP-hardness, motion planning, terrain
1	Erik D. Demaine, Jeff Erickson 0001, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides	Separating point sets in polygonal environments.	SCG	2004	DBLP DOI BibTeX RDF	polygons, separability, geodesics, chords
1	Russel A. Apu, Marina L. Gavrilova	Adaptive mesh generation for real-time terrain modeling.	SCG	2004	DBLP DOI BibTeX RDF	adaptive loop subdivision methods, cascading coupling march method, real-time terrain visualization, triangle mesh update, computational geometry
1	Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich	Deterministic sampling and range counting in geometric data streams.	SCG	2004	DBLP DOI BibTeX RDF
1	János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth 0001	Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].	SCG	2004	DBLP DOI BibTeX RDF
1	Artur Czumaj, Hairong Zhao	Fault-tolerant geometric spanners.	SCG	2003	DBLP DOI BibTeX RDF	fault-tolerant spanners, computational geometry, greedy algorithms, spanners
1	Kaspar Fischer, Bernd Gärtner	The smallest enclosing ball of balls: combinatorial structure and algorithms.	SCG	2003	DBLP DOI BibTeX RDF	distance to convex hull, minimal covering ball, minimum volume sphere, unique sink orientation
1	Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg	Efficient algorithms for shared camera control.	SCG	2003	DBLP DOI BibTeX RDF	webcamera, collaboration, approximation, sweep
1	Sergio Cabello, Marc J. van Kreveld	Approximation algorithms for aligning points.	SCG	2003	DBLP DOI BibTeX RDF
1	Gill Barequet, Evgeny Yakersberg	Morphing between shapes by using their straight skeletons.	SCG	2003	DBLP DOI BibTeX RDF	piecewise-linear surface interpolation, morphing, straight skeleton
1	Oswin Aichholzer, Franz Aurenhammer, Peter Braay	Spatial embedding of pseudo-triangulations.	SCG	2003	DBLP DOI BibTeX RDF	constrained regular complexes, polytope representation, three-dimensional embedding, pseudo-triangulations
1	Xavier Décoret, Frédo Durand, François X. Sillion	Billboard clouds.	SCG	2003	DBLP DOI BibTeX RDF	error-driven simplification, extreme simplification, image-based rendering, real-time rendering, Hough transform, billboard
1	Marc J. van Kreveld, Iris Reinbacher	Good NEWS: partitioning a simple polygon by compass directions.	SCG	2003	DBLP DOI BibTeX RDF	equal-area partitioning, spatial information retrieval, simple polygon
1	Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang	Cost-driven octree construction schemes: an experimental study.	SCG	2003	DBLP DOI BibTeX RDF	average performance, space decomposition, cost model, octree, ray shooting, cost prediction
1	Jeff Erickson 0001	Local polyhedra and geometric graphs.	SCG	2003	DBLP DOI BibTeX RDF	realistic input models, collision detection, bounding volume hierarchies, binary space partition
1	John Iacono	A 3-D visualization of kirkpatrick's planar point location algorithm.	SCG	2003	DBLP DOI BibTeX RDF	planar point location
1	David Cohen-Steiner, Jean-Marie Morvan	Restricted delaunay triangulations and normal cycle.	SCG	2003	DBLP DOI BibTeX RDF	geometric measure theory, mesh, curvature
1	Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci	Loops in reeb graphs of 2-manifolds.	SCG	2003	DBLP DOI BibTeX RDF	2-manifolds, Morse functions, algorithms, level sets, computational topology, loops, Reeb graphs
1	Frantisek Brabec, Hanan Samet, Cemal Yilmaz	VASCO: visualizing and animating spatial constructs and operations.	SCG	2003	DBLP DOI BibTeX RDF	visualization, quadtrees, R-trees, k-d trees, nearest neighbor algorithms
1	József Solymosi, Van H. Vu	Distinct distances in homogeneous sets.	SCG	2003	DBLP DOI BibTeX RDF	distance sets
1	János Pach, Rom Pinchasi, Micha Sharir	A tight bound for the number of different directions in three dimensions.	SCG	2003	DBLP DOI BibTeX RDF	Ungar's theorem, slope problem, directions
1	Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley	Cache-oblivious data structures for orthogonal range searching.	SCG	2003	DBLP DOI BibTeX RDF	cache-oblivious, orthogonal range searching
1	Dan Halperin, Eran Leiserowitz	Controlled perturbation for arrangements of circles.	SCG	2003	DBLP DOI BibTeX RDF	robustness, arrangements, perturbation
1	Tom Murtagh, Seok-Hee Hong 0001	3DTreeDraw: a thjree dimensional tree drawing system.	SCG	2003	DBLP DOI BibTeX RDF	trees, symmetry, graph drawing, three dimensions
1	Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote	Finding a curve in a map.	SCG	2003	DBLP DOI BibTeX RDF	Fréchet distance, shape matching
1	Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley	Planar minimally rigid graphs and pseudo-triangulations.	SCG	2003	DBLP DOI BibTeX RDF	graph drawing, rigidity, pseudo-triangulation
1	Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell	Online dispersion algorithms for swarms of robots.	SCG	2003	DBLP DOI BibTeX RDF	approximation algorithms, NP-hardness, swarm robotics
1	József Balogh, Oded Regev 0001, Clifford D. Smyth, William L. Steiger, Mario Szegedy	Long monotone paths in line arrangements.	SCG	2003	DBLP DOI BibTeX RDF	discrete line arrangements, monotone paths
1	Sariel Har-Peled, Kasturi R. Varadarajan	High-dimensional shape fitting in linear time.	SCG	2003	DBLP DOI BibTeX RDF	computational convexity, projective clustering
1	Rom Pinchasi, Rados Radoicic	Topological graphs with no self-intersecting cycle of lenth 4.	SCG	2003	DBLP DOI BibTeX RDF	extremal graph theory, self-intersecting cycle, topological graphs
1	Joachim Giesen, Uli Wagner 0001	Shape dimension and intrinsic metric from samples of manifolds with high co-dimension.	SCG	2003	DBLP DOI BibTeX RDF	dimension detection, manifold learning, geodesic distance
1	Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang 0001	Hausdorff distance under translation for points and balls.	SCG	2003	DBLP DOI BibTeX RDF	1-median, Voronoi diagrams, shape matching, Hausdorff distance
1	Sylvain Pion, Chee-Keng Yap	Constructive root bound for k-ary rational input numbers.	SCG	2003	DBLP DOI BibTeX RDF	constructive root bounds, k-ary rational numbers, robust numerical algorithms, exact geometric computation
1	Jonathan Richard Shewchuk	Updating and constructing constrained delaunay and constrained regular triangulations by flips.	SCG	2003	DBLP DOI BibTeX RDF	bistellar flip, constrained delaunay triangulation
1	Nina Amenta, Sunghee Choi, Günter Rote	Incremental constructions con BRIO.	SCG	2003	DBLP DOI BibTeX RDF	randomized incremental construction, delaunay triangulation, virtual memory
1	Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos	Curve reconstruction from noisy samples.	SCG	2003	DBLP DOI BibTeX RDF	sampling, probabilistic analysis, curve reconstruction
1	Marshall W. Bern, David Eppstein	Optimized color gamuts for tiled displays.	SCG	2003	DBLP DOI BibTeX RDF	additive color, color gamuts, high-resolution display systems, quasiconvex programming, tiled displays, geometric optimization, gamut mapping
1	Sariel Har-Peled, Shakhar Smorodinsky	On conflict-free coloring of points and simple regions in the plane.	SCG	2003	DBLP DOI BibTeX RDF	coloring, cellular network, frequency assignment
1	Danny Z. Chen, Xiaobo Hu 0001, Shuang Luan, Chao Wang 0002, Xiaodong Wu 0001	Geometric algorithms for static leaf sequencing problems in radiation therapy.	SCG	2003	DBLP DOI BibTeX RDF	leaf sequencing, monotone polygons, polygon partition, network flows, radiation therapy, IMRT
1	Vladlen Koltun, Micha Sharir	Curve-sensitive cuttings.	SCG	2003	DBLP DOI BibTeX RDF	many cells, arrangements, cuttings, curves and surfaces, zone
1	Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides	The complexity of (un)folding.	SCG	2003	DBLP DOI BibTeX RDF	linkage reconfiguration, computational geometry, PSPACE-completeness
1	Jirí Matousek 0001	New constructions of weak epsilon-nets.	SCG	2003	DBLP DOI BibTeX RDF	weak epsilon-nets
1	Laurent Dupont 0004, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean	Near-optimal parameterization of the intersection of quadrics.	SCG	2003	DBLP DOI BibTeX RDF	quadric surface intersection, robustness of geometric computations
1	John Hershberger 0001	Smooth kinetic maintenance of clusters.	SCG	2003	DBLP DOI BibTeX RDF	clustering, kinetic data structures
1	Timothy M. Chan	Euclidean bounded-degree spanning tree ratios.	SCG	2003	DBLP DOI BibTeX RDF	approximation, minimum spanning trees, discrete geometry
1	Niloy J. Mitra, An Thanh Nguyen	Estimating surface normals in noisy point cloud data.	SCG	2003	DBLP DOI BibTeX RDF	neighborhood size estimation, noisy data, normal estimation, eigen analysis
1	François Labelle, Jonathan Richard Shewchuk	Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation.	SCG	2003	DBLP DOI BibTeX RDF	anisotropic Voronoi diagram, anisotropic mesh generation
1	Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha	Fast penetration depth estimation using rasterization hardware and hierarchical refinement.	SCG	2003	DBLP DOI BibTeX RDF
1	John Iacono, Stefan Langerman	Proximate planar point location.	SCG	2003	DBLP DOI BibTeX RDF	planar point location
1	Frédéric Cazals, Frédéric Chazal, Thomas Lewiner	Molecular shape analysis based upon the morse-smale complex and the connolly function.	SCG	2003	DBLP DOI BibTeX RDF	diff. geom., meshes, shape matching, Morse theory
1	David E. Cardoze	An optimal algorithm for the minimum edge cardinality cut surface problem.	SCG	2003	DBLP DOI BibTeX RDF	manifold conversion, computer graphics, scientific visualization, computational topology
1	Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci	Morse-smale complexes for piecewise linear 3-manifolds.	SCG	2003	DBLP DOI BibTeX RDF	computational geometry and topology, triangulations, combinatorial algorithms, Morse theory, densities
1	Mirela Tanase, Remco C. Veltkamp	Polygon decomposition based on the straight line skeleton.	SCG	2003	DBLP DOI BibTeX RDF	straight line skeleton, polygonal decomposition
1	Dominique Attali, Jean-Daniel Boissonnat, André Lieutier	Complexity of the delaunay triangulation of points on surfaces the smooth case.	SCG	2003	DBLP DOI BibTeX RDF	generic surfaces, complexity, Voronoi diagram, reconstruction, Delaunay triangulation, smooth surfaces
1	Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper	the asteroid surveying problem and other puzzles.	SCG	2003	DBLP DOI BibTeX RDF	geometric constants, curves
1	Sariel Har-Peled, Yusu Wang 0001	Shape fitting with outliers.	SCG	2003	DBLP DOI BibTeX RDF	approximation, outliers, shape fitting
1	Günter Rote	Pseudotriangulations, polytopes, and how to expand linkages.	SCG	2002	DBLP DOI BibTeX RDF	pseudotriangulations, motion planning, polytopes
1	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	SCG	2002	DBLP DOI BibTeX RDF	d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
1	Vladlen Koltun, Micha Sharir	Polyhedral Voronoi diagrams of polyhedra in three dimensions.	SCG	2002	DBLP DOI BibTeX RDF	polyhedral distance function, polyhedral sites, Voronoi diagrams, three dimensions
1	Sunghee Choi	The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi.	SCG	2002	DBLP DOI BibTeX RDF	Delaunay triangulation
1	L. Paul Chew, Klara Kedem	Finding the consensus shape for a protein family.	SCG	2002	DBLP DOI BibTeX RDF	protein alignment, protein families, unit-vector RMS, dynamic programming, protein structure, multiple alignment
1	Sariel Har-Peled, Kasturi R. Varadarajan	Projective clustering in high dimensions using core-sets.	SCG	2002	DBLP DOI BibTeX RDF	computational convexity, projective clustering
1	Vladlen Koltun, Micha Sharir	Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations.	SCG	2002	DBLP DOI BibTeX RDF	Voronoi diagrams, lines, three dimensions, lower envelopes
1	Hayim Shaul, Dan Halperin	Improved construction of vertical decompositions of three-dimensional arrangements.	SCG	2002	DBLP DOI BibTeX RDF	geometric software, vertical decomposition, arrangements, exact computation
1	René van Oostrum, Remco C. Veltkamp	Parametric search made practical.	SCG	2002	DBLP DOI BibTeX RDF	framework for parametric search, implementation
1	Stanislav V. Klimenko, Gregory M. Nielson, Lialia Nikitina, Igor N. Nikitin	Adventures of Möbius band: mathematical visualization in virtual environment.	SCG	2002	DBLP DOI BibTeX RDF	virtual environments, mathematical visualization
1	Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink	Interlocked open linkages with few joints.	SCG	2002	DBLP DOI BibTeX RDF	protein models, configurations, geometry, linkages, knots, robotic arms
1	Boris Aronov, Vladlen Koltun, Micha Sharir	Incidences between points and circles in three and higher dimensions.	SCG	2002	DBLP DOI BibTeX RDF	three dimensions, combinatorial geometry, incidences, circles
1	Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson	Box-trees for collision checking in industrial installations.	SCG	2002	DBLP DOI BibTeX RDF	box-tree, orthogonal range query, slicing number, bounding-volume hierarchy, window query
1	Ciprian Borcea, Ileana Streinu	On the number of embeddings of minimally rigid graphs.	SCG	2002	DBLP DOI BibTeX RDF	Cayley-Menger variety, lower bound, upper bound, graph embedding, rigidity, distance geometry
1	David G. Kirkpatrick, Bettina Speckmann	Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons.	SCG	2002	DBLP DOI BibTeX RDF
1	Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu	A local search approximation algorithm for k-means clustering.	SCG	2002	DBLP DOI BibTeX RDF	clustering, approximation algorithms, computational geometry, local search, k-means
1	Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky	Lenses in arrangements of pseudo-circles and their applications.	SCG	2002	DBLP DOI BibTeX RDF	distinct distances, pseudo-circles, arrangements, lenses, incidences, levels
1	Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang	Optimal decomposition of polygonal models into triangle strips.	SCG	2002	DBLP DOI BibTeX RDF	tristrips, NP-completeness, integer programming, rendering, branch and bound, triangle strips
1	Oswin Aichholzer, Franz Aurenhammer, Belén Palop	Quickest paths, straight skeletons, and the city Voronoi diagram.	SCG	2002	DBLP DOI BibTeX RDF	wavefront model, shortest path, Voronoi diagram, transportation network, straight skeleton
1	Alon Efrat, Stephen G. Kobourov, Michael Stepp, Carola Wenk	Growing fat graphs.	SCG	2002	DBLP DOI BibTeX RDF
1	Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe	Efficient maintenance and self-collision testing for Kinematic Chains.	SCG	2002	DBLP DOI BibTeX RDF	modelling Kinematic Chain, collision detection, molecular modelling, bounding volume hierarchy, self collisions
1	David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec	Conforming Delaunay triangulations in 3D.	SCG	2002	DBLP DOI BibTeX RDF	conforming Delaunay triangulations, meshes, Delaunay triangulations
1	David Goldberg 0001, Christopher Malon, Marshall W. Bern	A global approach to automatic solution of jigsaw puzzles.	SCG	2002	DBLP DOI BibTeX RDF	fiducial points, shape matching, mesh smoothing
1	Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink	Testing Homotopy for paths in the plane.	SCG	2002	DBLP DOI BibTeX RDF	simple paths, computational topology, Homotopy
1	Piotr Indyk	Approximate nearest neighbor algorithms for Frechet distance via product metrics.	SCG	2002	DBLP DOI BibTeX RDF
1	Daniel Kotzor, Thorsten Theobald	Homotopy techniques for real-time visualization of geometric tangent problems.	SCG	2002	DBLP DOI BibTeX RDF
1	Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir	Visibility preserving terrain simplification: an experimental study.	SCG	2002	DBLP DOI BibTeX RDF	ridge networks, geographic information systems, visibility, terrain modeling, surface simplification
1	Igor Guskov, Andrei Khodakovsky, Peter Schröder, Wim Sweldens	Hybrid meshes: multiresolution using regular and irregular refinement.	SCG	2002	DBLP DOI BibTeX RDF	geometric modeling, remeshing, polygonal modeling, level of detail algorithms, compression algorithms, curves & surfaces
1	Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek 0001	The one-round Voronoi game.	SCG	2002	DBLP DOI BibTeX RDF	Voronoi game, competitive facility location, Voronoi diagram
1	Ilan Newman, Yuri Rabinovich	A lower bound on the distortion of embedding planar metrics into Euclidean space.	SCG	2002	DBLP DOI BibTeX RDF	embedding into Eucledian spaces, metric spaces
1	Mordecai J. Golin, Hyeon-Suk Na	The probabilistic complexity of the Voronoi diagram of points on a polyhedron.	SCG	2002	DBLP DOI BibTeX RDF
1	Erik D. Demaine, David Eppstein, Jeff Erickson 0001, George W. Hart, Joseph O'Rourke	Vertex-unfoldings of simplicial manifolds.	SCG	2002	DBLP DOI BibTeX RDF	edge-unfolding, facet cycles, facet paths, facet-vertex incidence graph, hinged dissections, manifolds with boundary, ridge-unfolding, simplicial manifolds, triangulated 2-manifolds, vertex-unfolding, unfolding, polyhedra
1	Leonidas J. Guibas, An Thanh Nguyen, Daniel Russel, Li Zhang 0001	Collision detection for deforming necklaces.	SCG	2002	DBLP DOI BibTeX RDF	deformable chains, collision detection, bounding volume hierarchy, power diagram
1	Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz	Exact minkowski sums and applications.	SCG	2002	DBLP DOI BibTeX RDF	geometric software, robustness and precision, motion planning, arrangements, Minkowski sums
1	Nathan Linial	Finite metric spaces: combinatorics, geometry and algorithms.	SCG	2002	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David Goldberg 0001	Paper position sensing.	SCG	2002	DBLP DOI BibTeX RDF	pose estimation, sensor fusion, total least squares
1	Micha Sharir, Emo Welzl	Point-line incidences in space.	SCG	2002	DBLP DOI BibTeX RDF	lines, three dimensions, incidences, circles
1	Ferran Hurtado, Vera Sacristán, Chandrajit Bajaj, Subhash Suri (eds.)	Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002	SCG	2002	DBLP DOI BibTeX RDF
1	Jeff Erickson 0001, Sariel Har-Peled	Optimally cutting a surface into a disk.	SCG	2002	DBLP DOI BibTeX RDF	cut graph, polygonal schema, polyhedral 2-manifold, approximation, NP-hardness, computational topology
1	Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang	Cost prediction for ray shooting.	SCG	2002	DBLP DOI BibTeX RDF	average performance, space decomposition, cost model, octree, ray shooting, cost prediction
1	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser	On the crossing number of complete graphs.	SCG	2002	DBLP DOI BibTeX RDF	rectilinear crossing number, complete graph, order type
1	Bernard Chazelle	The power of nonmonotonicity in geometric searching.	SCG	2002	DBLP DOI BibTeX RDF	spectral bounds, fourier transform, circuit complexity, range searching

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