Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Eran Eyal, Dan Halperin	Dynamic maintenance of molecular surfaces under conformational changes.	SCG	2005	DBLP DOI BibTeX RDF	controlled perturbation, molecular simulations, robust geometric computing, dynamic data structures, molecular surfaces
1	Pier Francesco Cortese, Giuseppe Di Battista	Clustered planarity.	SCG	2005	DBLP DOI BibTeX RDF	cluster, graph drawing, planarity
1	David Cohen-Steiner, Herbert Edelsbrunner	Inequalities for the curvature of curves and surfaces.	SCG	2005	DBLP DOI BibTeX RDF	Fréchet distance, bottleneck distance, integral geometry, persistence diagrams, stability, approximation, curvature
1	Lars Arge, Mark de Berg, Herman J. Haverkort	Cache-oblivious r-trees.	SCG	2005	DBLP DOI BibTeX RDF	cache-oblivious data structures, R-trees, geometric data structures, I/O-efficiency
1	Esther Ezra	Almost tight bound for a single cell in an arrangement of convex polyhedra in R3.	SCG	2005	DBLP DOI BibTeX RDF
1	Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen	Hadwiger and Helly-type theorems for disjoint unit spheres in R3.	SCG	2005	DBLP DOI BibTeX RDF	Hadwiger theorem, Helly theorem, unit ball, unit sphere, line transversal
1	Danny Z. Chen, Xiaobo Sharon Hu, Chao Wang 0002, Xiaodong Wu 0001	Mountain reduction, block matching, and applications in intensity-modulated radiation therapy.	SCG	2005	DBLP DOI BibTeX RDF	leaf sequencing, mountain reduction, profile-preserving cutting, block matching, radiation therapy, IMRT
1	Frédéric Chazal, André Lieutier	Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples.	SCG	2005	DBLP DOI BibTeX RDF	homotopy type, topological persistence, reverse engineering, surface reconstruction
1	Vikas Singh, Lopamudra Mukherjee, Jinhui Xu 0001, Kenneth R. Hoffmann, Guang Xu, Zhenming Chen	Efficient geometric techniques for reconstructing 3D vessel trees from biplane image.	SCG	2005	DBLP DOI BibTeX RDF	biplane geometry, topological peeling, topological walk, arrangement, geometric optimization
1	Yakov Nekrich	Space efficient dynamic orthogonal range reporting.	SCG	2005	DBLP DOI BibTeX RDF	computational geometry, dynamic data structures, algorithms and data structures, orthogonal range searching
1	Mohammad Ali Abam, Mark de Berg	Kinetic sorting and kinetic convex hulls.	SCG	2005	DBLP DOI BibTeX RDF	kinetic convex hulls, kinetic sorting, lower bounds, kinetic data structures
1	Sariel Har-Peled, Alper Üngör	A time-optimal delaunay refinement algorithm in two dimensions.	SCG	2005	DBLP DOI BibTeX RDF	delaunay triangulation, quadtree, steiner points, mesh quality, mesh refinement
1	Sergey Bereg	Certifying and constructing minimally rigid graphs in the plane.	SCG	2005	DBLP DOI BibTeX RDF	Henneberg construction, rigidity theory, computational geometry, tree decomposition, pseudo-triangulation
1	György Elekes, Csaba D. Tóth	Incidences of not-too-degenerate hyperplanes.	SCG	2005	DBLP DOI BibTeX RDF	Szemerédi-Trotter theorem, incidences
1	A. G. Oliveira, Pedro Jussieu de Rezende, F. P. Selmi-Dei	An extension of CGAL to the oriented projective plane T2 and its dynamic visualization system.	SCG	2005	DBLP DOI BibTeX RDF	oriented projective plane, visualization, algorithm animation, CGAL
1	David Eppstein, Kevin A. Wortman	Minimum dilation stars.	SCG	2005	DBLP DOI BibTeX RDF	euclidean graphs, quasiconvex programming, facility location, dilation, stretch factor
1	Timothy M. Chan, Eric Y. Chen	Multi-pass geometric algorithms.	SCG	2005	DBLP DOI BibTeX RDF	linear programming, convex hulls, streaming algorithms
1	Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu	Guarding a terrain by two watchtowers.	SCG	2005	DBLP DOI BibTeX RDF	terrain guarding, visibility algorithms, computational geometry, art gallery, parametric search
1	Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron	Maximizing the overlap of two planar convex sets under rigid motions.	SCG	2005	DBLP DOI BibTeX RDF	convex shape, approximation algorithm, pattern matching, sublinear algorithm
1	Oswin Aichholzer, Hannes Krasser	Abstract order type extension and new results on the rectilinear crossing number.	SCG	2005	DBLP DOI BibTeX RDF	pseudoline arrangement, rectilinear crossing number, complete graph, order type
1	Kim Hansen, Stephen K. Wismath	Animation of curve constrained drawings of planar graphs.	SCG	2005	DBLP DOI BibTeX RDF	animation, graph drawing
1	Sander Florisson, Marc J. van Kreveld, Bettina Speckmann	Rectangular cartograms: construction & animation.	SCG	2005	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Yajun Wang 0001, Zhuangzhi Wu	Provable dimension detection using principal component analysis.	SCG	2005	DBLP DOI BibTeX RDF	dimension detection, principal component analysis, sampling
1	Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot	Learning smooth objects by probing.	SCG	2005	DBLP DOI BibTeX RDF	blind surface approximation, interactive surface reconstruction, manifold learning, surface meshing, Delaunay refinement
1	Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri	Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction.	SCG	2005	DBLP DOI BibTeX RDF
1	János Pach, Gábor Tardos	Forbidden patterns and unit distances.	SCG	2005	DBLP DOI BibTeX RDF	0-1 matrix, extremal combinatorics, forbidden patterns, interval chromatic number, unit-distance graph
1	Kenneth L. Clarkson, Kasturi R. Varadarajan	Improved approximation algorithms for geometric set cover.	SCG	2005	DBLP DOI BibTeX RDF	algorithms, approximation, set cover
1	Gill Barequet, Yuval Scharf, Matthew T. Dickerson	Covering points with a polygon.	SCG	2005	DBLP DOI BibTeX RDF	covering points
1	Sariel Har-Peled, Akash Kushal	Smaller coresets for k-median and k-means clustering.	SCG	2005	DBLP DOI BibTeX RDF	clustering, coresets
1	Gereon Frahling, Piotr Indyk, Christian Sohler	Sampling in dynamic data streams and applications.	SCG	2005	DBLP DOI BibTeX RDF	data structures, computational geometry, streaming algorithms
1	Dominique Attali, Herbert Edelsbrunner	Inclusion-exclusion formulas from independent complexes.	SCG	2005	DBLP DOI BibTeX RDF	dual complexes, indicator functions, discrete geometry, spheres, combinatorial topology, balls
1	Ron Wein, Jur P. van den Berg, Dan Halperin	The Visibility-Voronoi Complex and Its Applications.	SCG	2005	DBLP DOI BibTeX RDF	path optimization, voronoi diagrams, motion planning, visibility graphs
1	Jonathan Richard Shewchuk	Star splaying: an algorithm for repairing delaunay triangulations and convex hulls.	SCG	2005	DBLP DOI BibTeX RDF	Delaunay repair, dynamic mesh generation, star flipping, star splaying, Delaunay triangulation, convex hull
1	Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert	An exact, complete and efficient implementation for computing planar maps of quadric intersection curves.	SCG	2005	DBLP DOI BibTeX RDF	computational geometry, robustness, arrangements, algebraic curves, exact geometric computation, algebraic surfaces
1	David Cohen-Steiner, Herbert Edelsbrunner, John Harer	Stability of persistence diagrams.	SCG	2005	DBLP DOI BibTeX RDF	stability, persistence, continuous functions, homology groups, combinatorial topology
1	Sergey Bereg, Adrian Dumitrescu	The lifting model for reconfiguration.	SCG	2005	DBLP DOI BibTeX RDF	lifting model, pseudodisks, reconfiguration, disks
1	Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap	Shortest path amidst disc obstacles is computable.	SCG	2005	DBLP DOI BibTeX RDF	disc obstacles, guaranteed precision computation, real RAM model, robust numerical algorithms, shortest path, exact geometric computation, exponential complexity
1	Sariel Har-Peled, Manor Mendel	Fast construction of nets in low dimensional metrics, and their applications.	SCG	2005	DBLP DOI BibTeX RDF	approximate distance oracle, compact representation scheme, well separated pair decomposition, spanners, approximate nearest neighbor search, doubling metrics
1	David Eppstein, Michael T. Goodrich, Jonathan Z. Sun	The skip quadtree: a simple dynamic data structure for multidimensional data.	SCG	2005	DBLP DOI BibTeX RDF	skip quadtree, approximation algorithm, nearest neighbor, quadtree, octree, range, dynamic data structure, point location
1	Sergey Bereg, David G. Kirkpatrick	Curvature-bounded traversals of narrow corridors.	SCG	2005	DBLP DOI BibTeX RDF	curvarure-bounded traversals, computational geometry, motion planning
1	Michael Hoffmann 0001, Csaba D. Tóth	Pointed and colored binary encompassing trees.	SCG	2005	DBLP DOI BibTeX RDF	spanning tree, line segments, bounded degree, pseudo-triangulation
1	Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic	Energy-aware stage illumination.	SCG	2005	DBLP DOI BibTeX RDF	art gallery problems, illumination problem, optimization
1	Efi Fogel, Dan Halperin	Exact Minkowski sums of convex polyhedra.	SCG	2005	DBLP DOI BibTeX RDF
1	Ajith Mascarenhas, Jack Snoeyink	Implementing time-varying contour trees.	SCG	2005	DBLP DOI BibTeX RDF	Morse functions, differential and computational topology, triangulations, level sets, combinatorial algorithms, critical points, contour tree
1	Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen	Cache-oblivious planar orthogonal range searching and counting.	SCG	2005	DBLP DOI BibTeX RDF	range counting, semi-group range queries, cache-oblivious, orthogonal range searching
1	Tobias Lenz	Reconstructing collections of arbitrary curves.	SCG	2005	DBLP DOI BibTeX RDF	intersection, greedy, curve reconstruction
1	Raimund Seidel, Nicola Wolpert	On the exact computation of the topology of real algebraic curves.	SCG	2005	DBLP DOI BibTeX RDF	computational geometry, robustness, algebraic curves, exact geometric computation
1	Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha	Fast and reliable collision detection using graphics processors.	SCG	2005	DBLP DOI BibTeX RDF	collision detection, deformable models, graphics hardware, Minkowski sums
1	Mark de Berg	Vertical ray shooting for fat objects.	SCG	2005	DBLP DOI BibTeX RDF	realistic input models, geometric data structures, ray shooting, fat objects
1	Uri Laserson, Hin Hark Gan, Tamar Schlick	Searching for 2D RNA geometries in bacterial genomes.	SCG	2004	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, János Pach	Pushing squares around.	SCG	2004	DBLP DOI BibTeX RDF	rectangular metamorphic systems, reconfiguration, motion planning
1	Timothy M. Chan	Faster core-set constructions and data stream algorithms in fixed dimensions.	SCG	2004	DBLP DOI BibTeX RDF	geometric optimization problems, approximation algorithms, data streams
1	Jack Snoeyink, Jean-Daniel Boissonnat (eds.)	Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004	SCG	2004	DBLP DOI BibTeX RDF
1	Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien	An energy-driven approach to linkage unfolding.	SCG	2004	DBLP DOI BibTeX RDF	carpenter's rule problem, knot energy, linkage reconfiguration, computational geometry, unfolding, gradient flow
1	Ilya Baran, Erik D. Demaine	Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve.	SCG	2004	DBLP DOI BibTeX RDF	adaptive algorithms, curves
1	Sándor P. Fekete, Rolf Klein, Andreas Nüchter	Searching with an autonomous robot.	SCG	2004	DBLP DOI BibTeX RDF	Kurt3D, competitive ration, online problems, three-dimensional laser scanning, visibility problems, watchman problems, searching, autonomous mobile robots
1	Pankaj K. Agarwal, Kasturi R. Varadarajan	A near-linear constant-factor approximation for euclidean bipartite matching?	SCG	2004	DBLP DOI BibTeX RDF	approximation algorithms, combinatorial optimization, matching
1	Jeff Erickson 0001, Sariel Har-Peled, David M. Mount	On the least median square problem.	SCG	2004	DBLP DOI BibTeX RDF	LMS regression, approximation algorithms, lower bounds, robust statistics
1	Olaf A. Hall-Holt	The corner arc algorithm.	SCG	2004	DBLP DOI BibTeX RDF	visibility, kinetic data structure, pseudo-triangulation
1	Günter M. Ziegler	Random monotone paths on polyhedra.	SCG	2004	DBLP DOI BibTeX RDF
1	David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu	A computational framework for incremental motion.	SCG	2004	DBLP DOI BibTeX RDF	incremental motion, competitive analysis, kinetic data structures
1	Hai Yu 0005, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan	Practical methods for shape fitting and kinetic data structures using core sets.	SCG	2004	DBLP DOI BibTeX RDF	extent measures, kinetic data structures, shape fitting, core sets
1	David Eppstein, M. Gopi 0001	Single-strip triangulation of manifolds with arbitrary topology.	SCG	2004	DBLP DOI BibTeX RDF	constrained path planning, fundamental cycles, hamiltonian paths and cycles, stripification, path planning, triangulation, space-filling curves
1	Cesim Erten, Stephen G. Kobourov, Chandan Pitta	Morphing planar graphs.	SCG	2004	DBLP DOI BibTeX RDF	graph drawing, planar graphs, morphing
1	Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell	Computing the visibility graph of points within a polygon.	SCG	2004	DBLP DOI BibTeX RDF	visibility, combinatorial complexity, lines in space
1	John Hershberger 0001, Subhash Suri, Csaba D. Tóth	Binary space partitions of orthogonal subdivisions.	SCG	2004	DBLP DOI BibTeX RDF	tilings, binary space partitions
1	Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang 0001	Extreme elevation on a 2-manifold.	SCG	2004	DBLP DOI BibTeX RDF	morse functions, pedal function, triangulations, persistence, combinatorial algorithms, critical points, surgery
1	Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray	Quality meshing for polyhedra with small angles.	SCG	2004	DBLP DOI BibTeX RDF	Delaunay triangulation, mesh generation, Delaunay refinement, local feature size
1	Stefan Funke, Theocharis Malamatos, Rahul Ray	Finding planar regions in a terrain: in practice and with a guarantree.	SCG	2004	DBLP DOI BibTeX RDF	approximation, terrain, planarity
1	Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni	Locality-sensitive hashing scheme based on p-stable distributions.	SCG	2004	DBLP DOI BibTeX RDF	p-stable distributions, locally sensitive hashing, sublinear algorithm, approximate nearest neighbor
1	Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin	Geodesic ham-sandwich cuts.	SCG	2004	DBLP DOI BibTeX RDF	ham-sandwich theorem, shortest paths, geodesics, simple polygons
1	Tamal K. Dey, Samrat Goswami	Provable surface reconstruction from noisy samples.	SCG	2004	DBLP DOI BibTeX RDF	sampling, noise, Voronoi diagram, surface reconstruction, Delaunay triangulations
1	János Pach, Rom Pinchasi, Micha Sharir	Solution of Scott's problem on the number of directions determined by a point set in 3-space.	SCG	2004	DBLP DOI BibTeX RDF	Scott's Conjecture, Ungar's Theorem, slope problem, directions, three dimensions
1	Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk	Low-dimensional embedding with extra information.	SCG	2004	DBLP DOI BibTeX RDF	angles, range graphs, approximation algorithms, metrics, distribution, graph embedding, order type
1	Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen	Towards in-place geometric algorithms and data structures.	SCG	2004	DBLP DOI BibTeX RDF	in-lace algorithms, Voronoi diagrams, convex hulls, range searching
1	Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci	Time-varying reeb graphs for continuous space-time data.	SCG	2004	DBLP DOI BibTeX RDF	differential and computational topology, morse functions, triangulations, level sets, combinatorial algorithms, critical points, reeb graph
1	Rom Pinchasi, Rados Radoicic, Micha Sharir	On empty convex polygons in a planar point set.	SCG	2004	DBLP DOI BibTeX RDF	continuous motion, empty ?-gon, empty hexagon
1	Afra Zomorodian, Gunnar E. Carlsson	Computing persistent homology.	SCG	2004	DBLP DOI BibTeX RDF	computational topology, persistent homology
1	Jyh-Ming Lien, Nancy M. Amato	Approximate convex decomposition.	SCG	2004	DBLP DOI BibTeX RDF	concavity measure, polygon, polyhedron, convex decomposition
1	Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert	Complete, exact, and efficient computations with cubic curves.	SCG	2004	DBLP DOI BibTeX RDF	sweep-line algorithm, computational geometry, robustness, arrangements, algebraic curves, exact geometric computation
1	Christian A. Duncan, David Eppstein, Stephen G. Kobourov	The geometric thickness of low degree graphs.	SCG	2004	DBLP DOI BibTeX RDF	geometric thickness, graph thickness, layered graphs, rectangle visibility, simultaneous embeddings, graph drawing
1	Jie Gao 0001, Leonidas J. Guibas, An Thanh Nguyen	Deformable spanners and applications.	SCG	2004	DBLP DOI BibTeX RDF	geometric k-center, proximity maintenance, spanner graphs, well-separated pair decomposition, collision detection, kinetic data structures, approximate nearest neighbor
1	Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides	The number of lines tangent to arbitrary convex polyhedra in 3D.	SCG	2004	DBLP DOI BibTeX RDF	3D visibility, visibility complex, visual events, computational geometry
1	Pankaj K. Agarwal, Micha Sharir, Emo Welzl	Algorithms for center and Tverberg points.	SCG	2004	DBLP DOI BibTeX RDF	center points, colored Tverberg's theorem, j-facets
1	Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir	On the union of kapa-round objects.	SCG	2004	DBLP DOI BibTeX RDF	union of objects, combinatorial complexity, fat objects
1	Pankaj K. Agarwal, Yusu Wang 0001, Hai Yu 0005	A 2D kinetic triangulation with near-quadratic topological changes.	SCG	2004	DBLP DOI BibTeX RDF	triangulation, random sampling, kinetic data structures
1	Esther Ezra, Micha Sharir	Counting and representing intersections among triangles in three dimensions.	SCG	2004	DBLP DOI BibTeX RDF	3SUM-hard problems, counting intersections, curve-sensitive cuttings, triangles in three dimensions, arrangements
1	Leonidas J. Guibas, Daniel Russel	An empirical comparison of techniques for updating Delaunay triangulations.	SCG	2004	DBLP DOI BibTeX RDF	Delaunay triangulation update motion
1	Jyh-Ming Lien, Nancy M. Amato	Approximate convex decomposition of polygons.	SCG	2004	DBLP DOI BibTeX RDF	hierarchical representation, convex decomposition, polygon decomposition
1	Olivier Devillers, Philippe Guigue	Inner and outer rounding of set operations on lattice polygonal regions.	SCG	2004	DBLP DOI BibTeX RDF	finite precision geometry, high level geometric rounding
1	Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin	Continuous path verification in multi-axis NC-machining.	SCG	2004	DBLP DOI BibTeX RDF	path verification, lower envelopes, NC-machining
1	Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark	A scalable simulator for forest dynamics.	SCG	2004	DBLP DOI BibTeX RDF	ecological forecasting, forest models, simulator, approximation algorithms, graphics hardware, geometric data structures
1	Rom Pinchasi, Shakhar Smorodinsky	On locally Delaunay geometric graphs.	SCG	2004	DBLP DOI BibTeX RDF	extremal graph theory, sensor networks, geometric graphs, Delaunay
1	David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington	A Bézier-based approach to unstructured moving meshes.	SCG	2004	DBLP DOI BibTeX RDF	Bézier triangles, moving meshes, computational geometry, finite element method, B-splines, mesh generation
1	Subhash Suri, Csaba D. Tóth, Yunhong Zhou	Range counting over multidimensional data streams.	SCG	2004	DBLP DOI BibTeX RDF	?-approximation, range counting, data streams
1	Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas	Towards and open curved kernel.	SCG	2004	DBLP DOI BibTeX RDF	conic arc, C++, arrangement, exact geometric computation
1	Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir	On lines avoiding unit balls in three dimensions.	SCG	2004	DBLP DOI BibTeX RDF	visibility, combinatorial complexity, lines in space
1	Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray	Sampling and meshing a surface with guaranteed topology and geometry.	SCG	2004	DBLP DOI BibTeX RDF	sampling, Voronoi diagram, Delaunay triangulation, surface meshing
1	Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean	Intersecting quadrics: an efficient and exact implementation.	SCG	2004	DBLP DOI BibTeX RDF	C++ implementation, intersection of quadrics, experimental analysis
1	Reza Abedi, Shuo-Heng Chung, Jeff Erickson 0001, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou	Spacetime meshing with adaptive refinement and coarsening.	SCG	2004	DBLP DOI BibTeX RDF	spacetime discontinuous Galerkin, adaptivity, mesh generation, tetrahedral meshes, unstructured meshes, advancing front

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