Search results for "computational geometry"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	George W. Hart	Computational geometry for sculpture.	Symposium on Computational Geometry	2001	DBLP DOI BibTeX RDF	computational geometry, art, polyhedra, polyhedron, sculpture
4	Peter Widmayer, Ying-Fung Wu, C. K. Wong	Distance problems in computational geometry with fixed orientations.	Symposium on Computational Geometry	1985	DBLP DOI BibTeX RDF
4	Frank K. H. A. Dehne, Hartmut Noltemeier	A computational geometry approach to clustering problems.	Symposium on Computational Geometry	1985	DBLP DOI BibTeX RDF
3	Paul Accisano, Alper Üngör	Geometric computation with smart pixels.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal	The euclidean bottleneck steiner path problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Gadi Aleksandrowicz, Gill Barequet	Redelmeier's algorithm for counting lattice animals.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Nathan M. Dunfield, Anil N. Hirani	The least spanning area of a knot and the optimal bounding chain problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Attila Gyulassy, Joshua A. Levine, Valerio Pascucci	Visualization of discrete gradient construction.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Ge Xia	Improved upper bound on the stretch factor of delaunay triangulations.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Alexander Gilbers, Rolf Klein	A new upper bound for the VC-dimension of visibility regions.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	David Eppstein, Maarten Löffler	Bounds on the complexity of halfspace intersections when the bounded faces have small dimension.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Eric Berberich, Michael Hemmer, Michael Kerber	A generic algebraic kernel for non-linear geometric applications.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Dominique Attali, André Lieutier, David Salinas	Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Leonidas J. Guibas, Quentin Mérigot, Dmitriy Morozov	Witnessed k-distance.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Daniel Reem	The geometric stability of voronoi diagrams with respect to small changes of the sites.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Therese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell	Guarding polyominoes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	René Brandenberg, Stefan König	No dimension independent core-sets for containment under homothetics.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Nicolas Chevallier, Yvan Maillot	Boundary of a non-uniform point cloud for reconstruction: extended abstract.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský	The potential to improve the choice: list conflict-free coloring for geometric hypergraphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Vida Dujmovic, Stefan Langerman	A center transversal theorem for hyperplanes and applications to graph drawing.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
3	Timothy M. Chan	Optimal partition trees.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	halfspace range searching, simplex range searching, geometric data structures
3	Cláudio T. Silva	Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	quadrilateral mesh processing, verifiable visualization, visualization, computer graphics
3	Florian Berger, Rolf Klein	A traveller's problem.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	affine mappings, continuous dijkstra, frogger, pseudo-polynomial approximation, computational geometry, partition, np-hardness, motion planning, undecidability
3	Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar	Linkless and flat embeddings in 3-space and the unknot problem.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	flat embedding, linkless embedding, unknot, knot
3	Helmut Alt	The Computational Geometry of Comparing Shapes.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF	computational geometry, computability, shapes, distance measures
3	Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler	Parallel geometric algorithms for multi-core computers.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	box intersection, compact container, d-dimension, spatial sort, parallel algorithms, multi-core, delaunay triangulations, geometric algorithms, kd-trees, cgal
3	Gaiane Panina, Ileana Streinu	Flattening single-vertex origami: the non-expansive case.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	expansive motion, spherical geometry, computational geometry, folding, origami, pseudo-triangulation
3	Audrey Lee, Ileana Streinu, Louis Theran	Analyzing rigidity with pebble games.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	computational geometry, rigidity, sparse graph, pebble game
3	Bernard Chazelle, Wolfgang Johann Heinrich Mulzer	Markov incremental constructions.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	clarkson-shor bound, randomized incremental constructions, expander graphs
3	Hans Raj Tiwary, Khaled M. Elbassioni	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality
3	Ileana Streinu, Louis Theran	Combinatorial genericity and minimal rigidity.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	computational geometry, rigidity, sparse graphs
3	Maarten Löffler, Jack Snoeyink	Delaunay triangulations of imprecise pointsin linear time after preprocessing.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	data imprecision, delaunay triangulation, minimum spanning tree, gabriel graph
3	Timothy M. Chan	A (slightly) faster algorithm for klee's measure problem.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	union of geometric objects, data structures, boxes
3	Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang	Querying approximate shortest paths in anisotropic regions.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	data structures, computational geometry, shortest path
3	Peyman Afshani, Timothy M. Chan	On approximate range counting and depth.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	data depth, computational geometry, approximation, approximate counting
3	Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr	Traversing a set of points with a minimum number of turns.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	minimum link spanning path, approximation algorithms, computational geometry
3	Hans Raj Tiwary	On the hardness of minkowski addition and related operations.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	coNP-hardness, extended convex hull, polytope intersection, computational geometry, polytopes, turing reduction, minkowski addition
3	Yakov Nekrich	A data structure for multi-dimensional range reporting.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	orthogonal range reporting, algorithms, data structures, computational geometry
3	Boris Aronov, Mark de Berg, Chris Gray	Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	computational geometry, ray shooting, fat objects, intersection searching
3	Eli Packer	Iterated snap rounding with bounded drift.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	finite precision approximation, geometric rounding, robustness, arrangements, line segments
3	Sunil Arya, Theocharis Malamatos, David M. Mount	The effect of corners on the complexity of approximate range searching.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
3	Bernard Chazelle, C. Seshadhri	Online geometric reconstruction.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	computational geometry, sublinear algorithms
3	Chee-Keng Yap	Complete subdivision algorithms, I: intersection of Bezier curves.	Symposium on Computational Geometry	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
3	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.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	LEDA, camera position, line segment intersection, computational geometry, convex hull, algorithm visualization, CGAL
3	Victor Milenkovic, Elisha Sacks	An approximate arrangement algorithm for semi-algebraic curves.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	robust computational geometry, arrangements
3	Sergey Bereg, David G. Kirkpatrick	Curvature-bounded traversals of narrow corridors.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	curvarure-bounded traversals, computational geometry, motion planning
3	Sergey Bereg	Certifying and constructing minimally rigid graphs in the plane.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	Henneberg construction, rigidity theory, computational geometry, tree decomposition, pseudo-triangulation
3	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.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	computational geometry, robustness, arrangements, algebraic curves, exact geometric computation, algebraic surfaces
3	János Pach, Gábor Tardos	Forbidden patterns and unit distances.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	0-1 matrix, extremal combinatorics, forbidden patterns, interval chromatic number, unit-distance graph
3	Yakov Nekrich	Space efficient dynamic orthogonal range reporting.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	computational geometry, dynamic data structures, algorithms and data structures, orthogonal range searching
3	Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap	Shortest path amidst disc obstacles is computable.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	disc obstacles, guaranteed precision computation, real RAM model, robust numerical algorithms, shortest path, exact geometric computation, exponential complexity
3	Gereon Frahling, Piotr Indyk, Christian Sohler	Sampling in dynamic data streams and applications.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	data structures, computational geometry, streaming algorithms
3	Raimund Seidel, Nicola Wolpert	On the exact computation of the topology of real algebraic curves.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	computational geometry, robustness, algebraic curves, exact geometric computation
3	Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson	Finding the best shortcut in a geometric network.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	approximation algorithms, computational geometry, geometric networks
3	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.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	oriented projective plane, visualization, algorithm animation, CGAL
3	Efi Fogel, Dan Halperin	Exact Minkowski sums of convex polyhedra.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF
3	Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu	Guarding a terrain by two watchtowers.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	terrain guarding, visibility algorithms, computational geometry, art gallery, parametric search
3	Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert	Complete, exact, and efficient computations with cubic curves.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	sweep-line algorithm, computational geometry, robustness, arrangements, algebraic curves, exact geometric computation
3	Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien	An energy-driven approach to linkage unfolding.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	carpenter's rule problem, knot energy, linkage reconfiguration, computational geometry, unfolding, gradient flow
3	Leonidas J. Guibas, Daniel Russel	An empirical comparison of techniques for updating Delaunay triangulations.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	Delaunay triangulation update motion
3	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.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	visibility complex, visual events, computational geometry, 3D visibility
3	Russel A. Apu, Marina L. Gavrilova	Adaptive mesh generation for real-time terrain modeling.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	adaptive loop subdivision methods, cascading coupling march method, real-time terrain visualization, triangle mesh update, computational geometry
3	Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk	Low-dimensional embedding with extra information.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	angles, range graphs, approximation algorithms, metrics, distribution, graph embedding, order type
3	János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth	Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF
3	David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington	A Bézier-based approach to unstructured moving meshes.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	Bézier triangles, moving meshes, computational geometry, finite element method, B-splines, mesh generation
3	Nina Amenta, Sunghee Choi, Günter Rote	Incremental constructions con BRIO.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	randomized incremental construction, delaunay triangulation, virtual memory
3	Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides	The complexity of (un)folding.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	linkage reconfiguration, computational geometry, PSPACE-completeness
3	Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci	Morse-smale complexes for piecewise linear 3-manifolds.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	computational geometry and topology, triangulations, combinatorial algorithms, Morse theory, densities
3	Artur Czumaj, Hairong Zhao	Fault-tolerant geometric spanners.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	fault-tolerant spanners, computational geometry, greedy algorithms, spanners
3	Herbert Edelsbrunner, Alper Üngör	Relaxed Scheduling in Dynamic Skin Triangulation.	JCDCG	2002	DBLP DOI BibTeX RDF	scheduling, Computational geometry, deformation, adaptive meshing
3	Y. B. Karasik, Micha Sharir	The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry.	Symposium on Computational Geometry	1993	DBLP DOI BibTeX RDF
3	Jan H. Vandenbrande, Aristides A. G. Requicha	Spatial Reasoning for the Automatic Recognition of Machinable Features in Solid Models.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	automatic feature recognition, machinable features, volumetric features, generate-and-test strategy, OPS-5 production rules, pattern recognition, computational geometry, computational geometry, planning, planning (artificial intelligence), solid models, solid modelling, manufacturability, spatial reasoning, spatial reasoning, CAD/CAM, blackboard, machining
3	A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack	A Computational geometry Workbench.	Symposium on Computational Geometry	1990	DBLP DOI BibTeX RDF
3	Russ Miller, Quentin F. Stout	Mesh Computer Algorithms for Computational Geometry.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	mesh computer algorithms, asymptotically optimal parallel algorithms, Cartesian coordinates, two-dimensional mesh computer, all-nearest neighbor problems, intersection problems, parallel algorithms, computational geometry, computational geometry, convex hull
3	Bruno Buchberger	Algebraic Methods for Non-Linear Computational Geometry (Invited Address).	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF
3	Kenneth L. Clarkson	Applications of Random Sampling in Computational Geometry, II.	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF
3	Franz Aurenhammer	Using Gale Transforms in Computational Geometry.	Workshop on Computational Geometry	1988	DBLP DOI BibTeX RDF
2	Ferran Hurtado, Marc J. van Kreveld (eds.)	Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011	Symposium on Computational Geometry	2011	DBLP BibTeX RDF
2	Manuel Caroli, Monique Teillaud	Delaunay triangulations of point sets in closed euclidean d-manifolds.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Umut A. Acar, Benoît Hudson, Duru Türkoglu	Kinetic mesh refinement in 2D.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova	Deconstructing approximate offsets.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Pankaj K. Agarwal, Thomas Mølhave, Hai Yu, James S. Clark	Exploiting temporal coherence in forest dynamics simulation.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier	Covering cubes and the closest vector problem.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Ross J. Kang, Tobias Müller	Sphere and dot product representations of graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Vít Jelínek, Jan Kratochvíl, Ignaz Rutter	A kuratowski-type theorem for planarity of partially embedded graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Boris Bukh, Alfredo Hubard	Space crossing numbers.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Menelaos I. Karavelas, Eleni Tzanaki	Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Sariel Har-Peled, Benjamin Raichel	The frechet distance revisited and extended.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Nikola Milosavljevic, Dmitriy Morozov, Primoz Skraba	Zigzag persistent homology in matrix multiplication time.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Stefan Huber, Martin Held	Theoretical and practical results on straight skeletons of planar straight-line graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Jeff Erickson	Shortest non-trivial cycles in directed surface graphs.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Tamal K. Dey, Yusu Wang	Reeb graphs: approximation and persistence.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu	Orthogonal range searching on the RAM, revisited.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Ciprian Borcea, Ileana Streinu	Extremal reaches in polynomial time.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth	Disjoint compatible geometric matchings.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Chao Chen, Michael Kerber	An output-sensitive algorithm for persistent homology.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin	Compressive sensing with local geometric features.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
2	Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe	Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF