Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Lilian Buzer	Optimal simplification of polygonal chain for rendering.	SCG	2007	DBLP DOI BibTeX RDF	approximation criterion, near linear time complexity, polygonal chain, rendering quality, implementation, efficiency, simplification
1	Efi Fogel, Dan Halperin, Christophe Weibel	On the exact maximum complexity of Minkowski sums of convex polyhedra.	SCG	2007	DBLP DOI BibTeX RDF	complexity, convex, polyhedra, Minkowski sum
1	Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev	Bi-criteria linear-time approximations for generalized k-mean/median/center.	SCG	2007	DBLP DOI BibTeX RDF	bi-criteria approximation, approximation, k-mean, geometric optimization, k-median, k-center
1	Saurabh Ray, Nabil H. Mustafa	An optimal generalization of the centerpoint theorem, and its extensions.	SCG	2007	DBLP DOI BibTeX RDF	centerpoint theorem, extremal methods, hitting convex sets, weak ?-nets, discrete geometry, combinatorial geometry
1	Peyman Afshani, Timothy M. Chan	On approximate range counting and depth.	SCG	2007	DBLP DOI BibTeX RDF	data depth, computational geometry, approximation, approximate counting
1	Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan	Kinetic 3D convex hulls via self-adjusting computation.	SCG	2007	DBLP DOI BibTeX RDF	convex hulls, kinetic data structures, self-adjusting computation
1	Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson	Aperture-angle and Hausdorff-approximation of convex figures.	SCG	2007	DBLP DOI BibTeX RDF	Hausdorff approximation, aperture angle, convex figure, subpolygon
1	Luis Rademacher	Approximating the centroid is hard.	SCG	2007	DBLP DOI BibTeX RDF	approximation, completeness, centroid, hardness, convex body
1	Piotr Indyk, Anastasios Sidiropoulos	Probabilistic embeddings of bounded genus graphs into planar graphs.	SCG	2007	DBLP DOI BibTeX RDF	bounded genus graphs, probabilistic approximation, embeddings, planar graphs
1	Frank Nielsen, Jean-Daniel Boissonnat, Richard Nock	Visualizing bregman voronoi diagrams.	SCG	2007	DBLP DOI BibTeX RDF	computational information geometry, Voronoi diagrams, Bregman divergences
1	Dan Feldman, Morteza Monemizadeh, Christian Sohler	A PTAS for k-means clustering based on weak coresets.	SCG	2007	DBLP DOI BibTeX RDF	approximation, k-mean, geometric optimization, coresets
1	Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr 0001	Traversing a set of points with a minimum number of turns.	SCG	2007	DBLP DOI BibTeX RDF	minimum link spanning path, approximation algorithms, computational geometry
1	Arno Eigenwillig, Lutz Kettner, Nicola Wolpert	Snap rounding of Bézier curves.	SCG	2007	DBLP DOI BibTeX RDF	Bézier curves, geometric rounding, intersection computation, snap rounding, robustness, splines, arrangement
1	Yevgeny Schreiber	Shortest paths on realistic polyhedra.	SCG	2007	DBLP DOI BibTeX RDF	continuous Dijkstra, realistic, shortest path, terrain, wavefront, polyhedral surface, shortest path map
1	Valentin Polishchuk, Joseph S. B. Mitchell	Thick non-crossing paths and minimum-cost flows in polygonal domains.	SCG	2007	DBLP DOI BibTeX RDF	geometric shortest paths, data structures, minimum-cost flows
1	Pankaj K. Agarwal, Hai Yu 0005	A space-optimal data-stream algorithm for coresets in the plane.	SCG	2007	DBLP DOI BibTeX RDF	extent measures, data streams, coresets
1	Victor Chepoi, Karim Nouioua	Pareto envelopes in R3 under l1 and linfinity distance functions.	SCG	2007	DBLP DOI BibTeX RDF	Pareto envelope, l1- and linf-distance, algorithm, dominance
1	Balint Miklos, Joachim Giesen, Mark Pauly	Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool.	SCG	2007	DBLP DOI BibTeX RDF	union of balls, Voronoi diagram, medial axis
1	Hazel Everett, Sylvain Lazard, Daniel Lazard, Mohab Safey El Din	The voronoi diagram of three lines.	SCG	2007	DBLP DOI BibTeX RDF	quadric surface intersection, Voronoi diagram, medial axis
1	Jonathan Backer, David G. Kirkpatrick	Finding curvature-constrained paths that avoid polygonal obstacles.	SCG	2007	DBLP DOI BibTeX RDF	bounded-curvature, path feasibility, motion planning
1	Yuanxin Liu, Jack Snoeyink	Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams.	SCG	2007	DBLP DOI BibTeX RDF	centroid triangulation, higher order Voronoi diagrams, multivariate splines
1	Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei	Streaming algorithms for line simplification.	SCG	2007	DBLP DOI BibTeX RDF	Frechet distance, Hausdorff distance, streaming algorithm, line simplification
1	Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean	Line transversals to disjoint balls.	SCG	2007	DBLP DOI BibTeX RDF	Hadwiger-type theorem, Helly-type theorem, disjoint balls, geometric transversal theory, convexity, lines, Hessian
1	Frédéric Cazals, Sébastien Loriot	Computing the exact arrangement of circles on a sphere, with applications in structural biology: video.	SCG	2007	DBLP DOI BibTeX RDF	Van der Waals models, robust geometric software, arrangements, molecular surfaces, structural biology
1	Kevin Buchin, André Schulz 0001	Inflating the cube by shrinking.	SCG	2007	DBLP DOI BibTeX RDF	submetric embeddings, surface deformation
1	Saurabh Ray, Nabil H. Mustafa	Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.	SCG	2007	DBLP DOI BibTeX RDF	hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry
1	Hans Raj Tiwary	On the hardness of minkowski addition and related operations.	SCG	2007	DBLP DOI BibTeX RDF	coNP-hardness, extended convex hull, polytope intersection, computational geometry, polytopes, turing reduction, minkowski addition
1	Boris Aronov, Sariel Har-Peled, Micha Sharir	On approximate halfspace range counting and relative epsilon-approximations.	SCG	2007	DBLP DOI BibTeX RDF	approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces
1	Ares Ribó Mor, Günter Rote, André Schulz 0001	Embedding 3-polytopes on a small grid.	SCG	2007	DBLP DOI BibTeX RDF	equilibrium stress, spring embedding
1	Liam Roditty	Fully dynamic geometric spanners.	SCG	2007	DBLP DOI BibTeX RDF	algorithms, dynamic, geometry, spanners
1	Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot	Manifold reconstruction in arbitrary dimensions using witness complexes.	SCG	2007	DBLP DOI BibTeX RDF	manifold reconstruction, restricted Delaunay triangulation, sampling conditions, witness complex
1	Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides	Towards an implementation of the 3D visibility skeleton.	SCG	2007	DBLP DOI BibTeX RDF	visibility skeleton
1	Frank Nielsen, Richard Nock	On approximating the smallest enclosing Bregman Balls.	SCG	2006	DBLP DOI BibTeX RDF	minimum enclosing ball, Bregman divergence, core-set
1	Marc Glisse	An upper bound on the average size of silhouettes.	SCG	2006	DBLP DOI BibTeX RDF	upper bound, silhouette, polyhedron
1	Mathieu Desbrun	Discrete differential forms and applications to surface tiling.	SCG	2006	DBLP DOI BibTeX RDF
1	Frédéric Chazal, André Lieutier	Topology guaranteeing manifold reconstruction using distance function to noisy data.	SCG	2006	DBLP DOI BibTeX RDF	surface and manifold reconstruction, sampling, distance function
1	Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas	The predicates for the Voronoi diagram of ellipses.	SCG	2006	DBLP DOI BibTeX RDF	Voronoi diagram, predicate, Euclidean distance, bisector, exact computation, ellipse, parametric representation
1	Pankaj K. Agarwal, Lars Arge, Ke Yi 0001	I/O-efficient batched union-find and its applications to terrain analysis.	SCG	2006	DBLP DOI BibTeX RDF	terrain analysis, algorithms, union-find, I/O-efficient, contour trees
1	Micha Sharir, Emo Welzl	Random triangulations of planar point sets.	SCG	2006	DBLP DOI BibTeX RDF	crossing-free geometric graphs, crossing-free spanning trees, degree sequences, number of triangulations, random triangulations, counting, charging
1	David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov	Vines and vineyards by updating persistence in linear time.	SCG	2006	DBLP DOI BibTeX RDF	folding trajectories, persistent homology groups, stability, implementation, dynamic algorithms, combinatorial topology
1	Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer	Optimal succinct representations of planar maps.	SCG	2006	DBLP DOI BibTeX RDF	graph encoding, planar maps, compression, mesh, succinct data structures, geometric data structures
1	Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos	Embedding ultrametrics into low-dimensional spaces.	SCG	2006	DBLP DOI BibTeX RDF	approximation algorithms, embedding, ultrametrics
1	Boris Aronov, Mark de Berg, Chris Gray	Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.	SCG	2006	DBLP DOI BibTeX RDF	computational geometry, ray shooting, fat objects, intersection searching
1	Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow	Engineering a compact parallel delaunay algorithm in 3D.	SCG	2006	DBLP DOI BibTeX RDF	parallel, meshing, space-efficient, Delaunay
1	Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen	On realistic terrains.	SCG	2006	DBLP DOI BibTeX RDF	polyhedral terrains, realistic input models, shortest paths, voronoi diagrams, visibility maps
1	Haim Kaplan, Micha Sharir, Elad Verbin	Colored intersection searching via sparse rectangular matrix multiplication.	SCG	2006	DBLP DOI BibTeX RDF	colored intersection searching, generalized intersection searching, matrix multiplication, range searching
1	Rajeev Motwani 0001, Assaf Naor, Rina Panigrahy	Lower bounds on locality sensitive hashing.	SCG	2006	DBLP DOI BibTeX RDF	lower bounds, nearest neighbor search, locality sensitive hashing
1	Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl	Pre-triangulations and liftable complexes.	SCG	2006	DBLP DOI BibTeX RDF
1	François Labelle	Sliver removal by lattice refinement.	SCG	2006	DBLP DOI BibTeX RDF	dihedral angle, sliver tetrahedron, tetrahedral mesh generation, mesh quality
1	Chee-Keng Yap	Complete subdivision algorithms, I: intersection of Bezier curves.	SCG	2006	DBLP DOI BibTeX RDF	curve intersection, methods for polynomials, robust geometric computation, robust numerical algorithms, subdivision method, computational geometry, geometric algorithms, exact geometric computation, Bezier curves
1	Rolf Klein, Martin Kutz	The density of iterated crossing points and a gap result for triangulations of finite point sets.	SCG	2006	DBLP DOI BibTeX RDF	spanning ratio, lower bound, triangulation, dilation, complete graph, stretch factor, plane graph, geometric network
1	Wolfgang Mulzer, Günter Rote	Minimum weight triangulation is NP-hard.	SCG	2006	DBLP DOI BibTeX RDF	PLANAR-1-IN-3-SAT, optimal triangulations
1	Ming-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee	A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects.	SCG	2006	DBLP DOI BibTeX RDF	LEDA, camera position, line segment intersection, computational geometry, convex hull, algorithm visualization, CGAL
1	Frédéric Chazal, David Cohen-Steiner, André Lieutier	A sampling theory for compact sets in Euclidean space.	SCG	2006	DBLP DOI BibTeX RDF	surface and manifold reconstruction, sampling, distance function
1	Boris Aronov, Paz Carmi, Matthew J. Katz	Minimum-cost load-balancing partitions.	SCG	2006	DBLP DOI BibTeX RDF	additive-weighted Voronoi diagrams, fat partitions, approximation algorithms, load balancing, geometric optimization, fatness
1	Kevin Buchin, Maike Buchin, Carola Wenk	Computing the Fréchet distance between simple polygons in polynomial time.	SCG	2006	DBLP DOI BibTeX RDF	Fréchet distance, shape matching, simple polygons
1	Sunil Arya, Theocharis Malamatos, David M. Mount	The effect of corners on the complexity of approximate range searching.	SCG	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
1	Eyal Ackerman	On the maximum number of edges in topological graphs with no four pairwise crossing edges.	SCG	2006	DBLP DOI BibTeX RDF	extremal graph theory, pairwise crossing edges, geometric graphs, topological graphs
1	Hayley N. Iben, James F. O'Brien, Erik D. Demaine	Refolding planar polygons.	SCG	2006	DBLP DOI BibTeX RDF	polygon interpolation, refolding, morphing, shape transformation
1	David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Tight bounds for connecting sites across barriers.	SCG	2006	DBLP DOI BibTeX RDF	spanning trees, crossing number
1	James R. Lee	Volume distortion for subsets of Euclidean spaces: extended abstract.	SCG	2006	DBLP DOI BibTeX RDF	graph bandwidth, metric embeddings, convex geometry
1	Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson 0001, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey	Minimum-cost coverage of point sets by disks.	SCG	2006	DBLP DOI BibTeX RDF	tour problems, complexity, approximation, geometric optimization, covering problems
1	Nico Kruithof, Gert Vegter	Envelope surfaces.	SCG	2006	DBLP DOI BibTeX RDF	Legendre-Fenchel transform, envelopes of spheres, piecewise quadratic surfaces, smooth surfaces
1	Noga Alon, Shakhar Smorodinsky	Conflict-free colorings of shallow discs.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, wireless, combinatorics, frequency-assignment
1	Gereon Frahling, Christian Sohler	A fast k-means implementation using coresets.	SCG	2006	DBLP DOI BibTeX RDF	Lloyds algorithm, clustering, k-means, coresets
1	Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink	Illustrating the streaming construction of 2D delaunay triangulations.	SCG	2006	DBLP DOI BibTeX RDF	memory management, Voronoi diagram, Delaunay triangulation, quadtree, streaming computation, out-of-core computation
1	Eli Packer	Iterated snap rounding with bounded drift.	SCG	2006	DBLP DOI BibTeX RDF	finite precision approximation, geometric rounding, robustness, arrangements, line segments
1	Joachim Giesen, Edgar A. Ramos, Bardia Sadri	Medial axis approximation and unstable flow complex.	SCG	2006	DBLP DOI BibTeX RDF	flow complex, stable and unstable manifolds, topological guarantee, gradient flow, medial axis approximation
1	Esther Ezra, Micha Sharir, Alon Efrat	On the ICP algorithm.	SCG	2006	DBLP DOI BibTeX RDF	pattern matching, Voronoi diagram, Hausdorff distance, ICP, RMS
1	Ke Chen 0006	How to play a coloring game against a color-blind adversary.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, online algorithm
1	János Pach, Géza Tóth 0001	Degenerate crossing numbers.	SCG	2006	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell	Algorithms for two-box covering.	SCG	2006	DBLP DOI BibTeX RDF	exact and approximate algorithms
1	Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci	Persistence-sensitive simplification functions on 2-manifolds.	SCG	2006	DBLP DOI BibTeX RDF
1	Amit Mhatre, Piyush Kumar	Projective clustering and its application to surface reconstruction: extended abstract.	SCG	2006	DBLP DOI BibTeX RDF	projective clustering, core sets
1	Stefan Funke, Christian Klein 0001	Hole detection or: "how much geometry hides in connectivity?".	SCG	2006	DBLP DOI BibTeX RDF	routing, graph theory, topology, embedding, virtual coordinates
1	Martin Kutz	Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time.	SCG	2006	DBLP DOI BibTeX RDF	non-trivial cycles, system of loops, universal cover, planar graph, efficient algorithm, computational topology
1	Jean-Daniel Boissonnat, Steve Oudot	Provably good sampling and meshing of Lipschitz surfaces.	SCG	2006	DBLP DOI BibTeX RDF	Lipschitz radius, Lipschitz surfaces, sampling conditions, surface meshing, local feature size
1	Bernard Chazelle, C. Seshadhri 0001	Online geometric reconstruction.	SCG	2006	DBLP DOI BibTeX RDF	computational geometry, sublinear algorithms
1	Yulai Xie, Jack Snoeyink, Jinhui Xu 0001	Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope.	SCG	2006	DBLP DOI BibTeX RDF	chebyshev center, maximum inscribed sphere, approximation, polytope, core-set
1	David Arthur, Sergei Vassilvitskii	How slow is the k-means method?	SCG	2006	DBLP DOI BibTeX RDF	lower bounds, local search, k-means
1	John Hershberger 0001	Improved output-sensitive snap rounding.	SCG	2006	DBLP DOI BibTeX RDF	robust geometric computation, snap rounding
1	Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap	Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.	SCG	2006	DBLP DOI BibTeX RDF
1	Nina Amenta, Otfried Cheong (eds.)	Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006	SCG	2006	DBLP DOI BibTeX RDF
1	Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote	Locked and unlocked chains of planar shapes.	SCG	2006	DBLP DOI BibTeX RDF	hinged dissections, locked chains, folding, linkages
1	Lars Arge, Norbert Zeh	Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching.	SCG	2006	DBLP DOI BibTeX RDF	data structures, memory hierarchies, range searching, cache-obliviousness
1	Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson 0001, Francis Lazarus, Kim Whittlesey	Splitting (complicated) surfaces is hard.	SCG	2006	DBLP DOI BibTeX RDF	combinatorial surface, splitting cycle, computational topology, topological graph theory
1	L. Paul Chew	Exact computation of protein structure similarity.	SCG	2006	DBLP DOI BibTeX RDF	protein geometry, structure comparison, dynamic programming, global optimization, convex hull, proteins, protein structure, extreme points
1	Sariel Har-Peled	How to get close to the median shape.	SCG	2006	DBLP DOI BibTeX RDF	approximation, shape fitting
1	Victor Milenkovic, Elisha Sacks	An approximate arrangement algorithm for semi-algebraic curves.	SCG	2006	DBLP DOI BibTeX RDF	robust computational geometry, arrangements
1	MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami	Plane embeddings of planar graph metrics.	SCG	2006	DBLP DOI BibTeX RDF	planar graphs, metric embedding, Euclidean plane
1	Vladlen Koltun, Micha Sharir	On overlays and minimization diagrams.	SCG	2006	DBLP DOI BibTeX RDF	minimization diagrams, Voronoi diagrams, overlays, arrangements, hyperplanes, power diagrams, lower envelopes
1	Sándor P. Fekete, Alexander Kröller	Geometry-based reasoning for a large sensor network.	SCG	2006	DBLP DOI BibTeX RDF	Shawn, SwarmNet, boundary recognition, topology extraction, sensor networks, distributed computing, flowers
1	Ke Chen 0006, Sariel Har-Peled	The orienteering problem in the plane revisited.	SCG	2006	DBLP DOI BibTeX RDF	k-TSP, approximation, orienteering problem
1	Yevgeny Schreiber, Micha Sharir	An optimal-time algorithm for shortest paths on a convex polytope in three dimensions.	SCG	2006	DBLP DOI BibTeX RDF	continuous Dijkstra, polytope surface, shortest path, unfolding, geodesics, wavefront, shortest path map
1	Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson	Finding the best shortcut in a geometric network.	SCG	2005	DBLP DOI BibTeX RDF	approximation algorithms, computational geometry, geometric networks
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	Jacob E. Goodman	Double-permutation sequences and pseudoline transversals.	SCG	2005	DBLP DOI BibTeX RDF	double-permutation sequence, pseudoline, convex set, transversal
1	Alireza Zarei, Mohammad Ghodsi	Efficient computation of query point visibility in polygons with holes.	SCG	2005	DBLP DOI BibTeX RDF	polygon with holes, visibility decomposition, visibility polygon
1	Joseph S. B. Mitchell, Günter Rote (eds.)	Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005	SCG	2005	DBLP DOI BibTeX RDF
1	Ovidiu Daescu, James D. Palmer	1-link shortest paths in weighted regions.	SCG	2005	DBLP DOI BibTeX RDF

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