Search results for "SCG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Démian Nave, Nikos Chrisochoides, L. Paul Chew	Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains.	SCG	2002	DBLP DOI BibTeX RDF	guaranteed-quality mesh generation, parallel mesh generation, delaunay triangulation
1	Alexander Bogomjakov, Craig Gotsman	AUTO-FOLLOW: getting a piece of the action all the time.	SCG	2002	DBLP DOI BibTeX RDF	auto-follow, edgebreaker, algorithm visualization
1	Nicola Geismann, Michael Hemmer, Elmar Schömer	The convex hull of ellipsoids.	SCG	2001	DBLP DOI BibTeX RDF
1	Helmut Alt, Laura Heinrich-Litan	Exact Linfty Nearest Neighbor Search in High Dimensions.	SCG	2001	DBLP DOI BibTeX RDF
1	Héctor H. González-Baños	A randomized art-gallery algorithm for sensor placement.	SCG	2001	DBLP DOI BibTeX RDF
1	József Solymosi, Csaba D. Tóth	On the distinct distances determined by a planar point set.	SCG	2001	DBLP DOI BibTeX RDF	Szemer 'edi-Trotter theorem, planar point set, crossing number
1	Thomas C. Hales	Sphere packings and generative.	SCG	2001	DBLP DOI BibTeX RDF
1	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell	Farthest neighbors and center points in the presence of rectangular obstacles.	SCG	2001	DBLP DOI BibTeX RDF
1	Saugata Basu	Different bounds on the different Betti numbers of semi-algebraic sets.	SCG	2001	DBLP DOI BibTeX RDF
1	Rados Radoicic, Géza Tóth 0001	Monotone paths in line arrangement.	SCG	2001	DBLP DOI BibTeX RDF
1	David P. Dobkin, Ayellet Tal	Small representation of line arrangements.	SCG	2001	DBLP DOI BibTeX RDF
1	Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha	PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation.	SCG	2001	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Joachim Giesen	Detecting undersampling in surface reconstruction.	SCG	2001	DBLP DOI BibTeX RDF
1	David P. Dobkin, Ayellet Tal	Efficient and small representation of line arrangements with applications.	SCG	2001	DBLP DOI BibTeX RDF
1	Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin	2-point site Voronoi diagrams.	SCG	2001	DBLP DOI BibTeX RDF
1	Csaba D. Tóth	A note on binary plane partitions.	SCG	2001	DBLP DOI BibTeX RDF	line segments, binary space partition
1	Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar 0001	Efficient perspective-accurate silhouette computation and applications.	SCG	2001	DBLP DOI BibTeX RDF	rendering, simplification, silhouette
1	Micha Sharir	The Clarkson-Shor technique revisited and extended.	SCG	2001	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort	Box-trees and R-trees with near-optimal query time.	SCG	2001	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Xiaobo Hu 0001, Yingping Huang, Yifan Li, Jinhui Xu 0001	Algorithms for congruent sphere packing and applications.	SCG	2001	DBLP DOI BibTeX RDF
1	Olivier Devillers, Sylvain Pion, Monique Teillaud	Walking in a triangulation.	SCG	2001	DBLP DOI BibTeX RDF
1	Diane L. Souvaine (eds.)	Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001	SCG	2001	DBLP DOI BibTeX RDF
1	Naoki Katoh, Takeshi Tokuyama	Notes on computing peaks in k-levels and parametric spanning trees.	SCG	2001	DBLP DOI BibTeX RDF
1	Lutz Kettner, Jack Snoeyink	A prototype system for visualizing time-dependent volume data.	SCG	2001	DBLP DOI BibTeX RDF
1	Timothy M. Chan	A fully dynamic algorithm for planar.	SCG	2001	DBLP DOI BibTeX RDF
1	Nicola Geismann, Michael Hemmer, Elmar Schömer	Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!	SCG	2001	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir	Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.	SCG	2001	DBLP DOI BibTeX RDF
1	George W. Hart	Computational geometry for sculpture.	SCG	2001	DBLP DOI BibTeX RDF	computational geometry, art, polyhedra, polyhedron, sculpture
1	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser	Enumerating order types for small sets with applications.	SCG	2001	DBLP DOI BibTeX RDF	triangulation, data base, geometric graph, oriented matroid, point configuration
1	Sariel Har-Peled	A practical approach for computing the diameter of a point set.	SCG	2001	DBLP DOI BibTeX RDF
1	Martin Isenburg, Stefan Gumhold, Craig Gotsman	The connectivity shapes video.	SCG	2001	DBLP DOI BibTeX RDF	implicit geometry, mesh connectivity, natural embedding, shape compression, polygon meshes
1	Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk	Schematization of road networks.	SCG	2001	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Micha Sharir	On the number of congruent simplices in a point.	SCG	2001	DBLP DOI BibTeX RDF
1	Mark de Berg, João Comba, Leonidas J. Guibas	A segment-tree based kinetic BSP.	SCG	2001	DBLP DOI BibTeX RDF
1	Frederic M. Richards	Protein geometry as a function of time.	SCG	2001	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, Damrong Guoy	Sink-insertion for mesh improvement.	SCG	2001	DBLP DOI BibTeX RDF
1	Vladlen Koltun	Segment intersection searching problems in general settings.	SCG	2001	DBLP DOI BibTeX RDF
1	Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust	Computing a canonical polygonal schema of an orientable triangulated surface.	SCG	2001	DBLP DOI BibTeX RDF
1	Stefan Langerman	On the complexity of halfspace area queries.	SCG	2001	DBLP DOI BibTeX RDF
1	Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian	Hardware-assisted view-dependent map simplification.	SCG	2001	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner, John Harer, Afra Zomorodian	Hierarchical morse complexes for piecewise linear 2-manifolds.	SCG	2001	DBLP DOI BibTeX RDF	algorithms, implementation, hierarchy, terrains
1	Matthew J. Katz, Kasturi R. Varadarajan	A tight bound on the number of geometric permutations of convex fat objects in Rd.	SCG	2001	DBLP DOI BibTeX RDF	separating set, fat objects
1	Alan Saalfeld	Area-preserving piecewise affine mappings.	SCG	2001	DBLP DOI BibTeX RDF	authalic transformations, piecewise affine homemorphisms
1	Micha Sharir, Emo Welzl	Balanced lines, halving triangles, and the generalized lower bound theorem.	SCG	2001	DBLP DOI BibTeX RDF	$k$-sets, Gale transform, Lovasz Lemma, balanced lines, generalized lower bound theorem, halving triangles
1	Ewgenij Gawrilow, Michael Joswig	Polymake: an approach to modular software design in computational geometry.	SCG	2001	DBLP DOI BibTeX RDF
1	Jie Gao 0001, Leonidas J. Guibas, John Hershberger 0001, Li Zhang 0001, An Zhu	Discrete mobile centers.	SCG	2001	DBLP DOI BibTeX RDF
1	Jeff Erickson 0001	Nice point sets can have nasty Delaunay triangulations.	SCG	2001	DBLP DOI BibTeX RDF	sample measure, lower bounds, sample, surface reconstruction, Delaunay triangulation, spread
1	Pierre Angelier, Michel Pocchiola	A sum of squares theorem for visibility.	SCG	2001	DBLP DOI BibTeX RDF
1	János Pach, Ido Safruti, Micha Sharir	The union of congruent cubes in three dimensions.	SCG	2001	DBLP DOI BibTeX RDF
1	Regina Estkowski, Joseph S. B. Mitchell	Simplifying a polygonal subdivision while keeping it simple.	SCG	2001	DBLP DOI BibTeX RDF
1	Stefan Funke, Kurt Mehlhorn	Look - a Lazy Object-Oriented Kernel for geometric computation.	SCG	2000	DBLP DOI BibTeX RDF
1	Bernard Chazelle, Alexey Lvov	A trace bound for the hereditary discrepancy.	SCG	2000	DBLP DOI BibTeX RDF
1	Kenneth E. Hoff III, Tim Culver, John Keyser, Ming C. Lin, Dinesh Manocha	Fast computation of generalized Voronoi diagrams using graphics hardware.	SCG	2000	DBLP DOI BibTeX RDF
1	Jonathan Richard Shewchuk	Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations.	SCG	2000	DBLP DOI BibTeX RDF
1	Steven M. LaValle, Borislav H. Simov, Giora Slutzki	An algorithm for searching a polygonal region with a flashlight.	SCG	2000	DBLP DOI BibTeX RDF
1	Edgar A. Ramos	Linear programming queries revisited.	SCG	2000	DBLP DOI BibTeX RDF
1	Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu	The analysis of a simple k-means clustering algorithm.	SCG	2000	DBLP DOI BibTeX RDF
1	János Pach, Gábor Tardos	Cutting glass.	SCG	2000	DBLP DOI BibTeX RDF
1	Victor Milenkovic	Densest tanslational lattice packing of non-convex polygons (extended abstract).	SCG	2000	DBLP DOI BibTeX RDF
1	Greg Leibon, David Letscher	Delaunay triangulations and Voronoi diagrams for Riemannian manifolds.	SCG	2000	DBLP DOI BibTeX RDF
1	Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger	A Helly-type theorem for hyperplane transversals to well-separated convex sets.	SCG	2000	DBLP DOI BibTeX RDF
1	Nina Amenta, Sunghee Choi, Tamal K. Dey, Naveen Leekha	A simple algorithm for homeomorphic surface reconstruction.	SCG	2000	DBLP DOI BibTeX RDF
1	David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann	Kinetic collision detection for simple polygons.	SCG	2000	DBLP DOI BibTeX RDF
1	Jesús A. De Loera, Frederick J. Wicklin	Viro's method disproves Ragsdale's conjecture: a story.	SCG	2000	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, John Hershberger 0001, Subhash Suri, Li Zhang 0001	Kinetic connectivity for unit disks.	SCG	2000	DBLP DOI BibTeX RDF
1	Micha Sharir, Shakhar Smorodinsky, Gábor Tardos	An improved bound for k-sets in three dimensions.	SCG	2000	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Frédéric Cazals	Smooth surface reconstruction via natural neighbour interpolation of distance functions.	SCG	2000	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia	Computing approximate shortest paths on convex polytopes.	SCG	2000	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Rephael Wenger	Reconstruction curves with sharp corners.	SCG	2000	DBLP DOI BibTeX RDF
1	Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos	Linear-time triangulation of a simple polygon made easier via randomization.	SCG	2000	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht	On the continuous Weber and k-median problems (extended abstract).	SCG	2000	DBLP DOI BibTeX RDF
1	Dan Halperin, Micha Sharir, Kenneth Y. Goldberg	The 2-center problem with obstacles.	SCG	2000	DBLP DOI BibTeX RDF
1	Sariel Har-Peled, Piotr Indyk	When crossings count - approximating the minimum spanning tree.	SCG	2000	DBLP DOI BibTeX RDF
1	Nina Amenta, Ravi Krishna Kolluri	Accurate and efficient unions of balls.	SCG	2000	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris	Computing integer points in Minkowski sums.	SCG	2000	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Otfried Cheong, Pankaj K. Agarwal, Steven Fortune (eds.)	Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000	SCG	2000	DBLP DOI BibTeX RDF
1	Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret	Point set labeling with specified positions.	SCG	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	Random sampling in geometric optimization: new insights and applications.	SCG	2000	DBLP DOI BibTeX RDF
1	Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud	Algebraic methods and arithmetic filtering for exact predicates on circle arcs.	SCG	2000	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David Eppstein	Multivariate regression depth.	SCG	2000	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec	Triangulations in CGAL (extended abstract).	SCG	2000	DBLP DOI BibTeX RDF
1	Peter Braß, Christian Knauer	Testing the congruence of d-dimensional point sets.	SCG	2000	DBLP DOI BibTeX RDF
1	Uli Wagner 0001, Emo Welzl	Origin-embracing distributions or a continuous analogue of the upper bound theorem.	SCG	2000	DBLP DOI BibTeX RDF
1	Afra Zomorodian, Herbert Edelsbrunner	Fast software for box intersections.	SCG	2000	DBLP DOI BibTeX RDF	box intersection, range tree, algorithms, implementation, experimentation, quantification, segment tree
1	Timothy M. Chan	Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus.	SCG	2000	DBLP DOI BibTeX RDF
1	Hisamoto Hiyoshi, Kokichi Sugihara	Voronoi-based interpolation with higher continuity.	SCG	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner	Pitfalls in computing with pseudorandom determinants.	SCG	2000	DBLP DOI BibTeX RDF
1	Lars Arge, Jan Vahrenhold	I/O-efficient dynamic planar point location (extended abstract).	SCG	2000	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Gerhard Trippen	Optimal robot localization in trees.	SCG	2000	DBLP DOI BibTeX RDF
1	Martin Isenburg, Jack Snoeyink	The face fixer video.	SCG	2000	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Otfried Cheong, Jirí Matousek 0001, Antoine Vigneron	Reachability by paths of bounded curvature in convex polygons.	SCG	2000	DBLP DOI BibTeX RDF
1	Edgar A. Ramos	Deterministic algorithms for 3-D diameter and some 2-D lower envelopes.	SCG	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Sven Schönherr	An efficient, exact, and generic quadratic programming solver for geometric optimization.	SCG	2000	DBLP DOI BibTeX RDF
1	Jonathan Richard Shewchuk	Mesh generation for domains with small angles.	SCG	2000	DBLP DOI BibTeX RDF
1	Géza Tóth 0001	Point sets with many k-sets.	SCG	2000	DBLP DOI BibTeX RDF
1	Matthias Müller-Hannemann	Improving the surface cycle structure for hexahedral mesh generation.	SCG	2000	DBLP DOI BibTeX RDF
1	Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen	Geometric Algorithms for Trap Design.	SCG	1999	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, Menelaos I. Karavelas	Interval Methods for Kinetic Simulations.	SCG	1999	DBLP DOI BibTeX RDF
1	Boris Aronov, Tamal K. Dey	Polytopes in Arrangements.	SCG	1999	DBLP DOI BibTeX RDF	plane arrangements, polytopes, combinatorial complexity, combinatorial geometry, hyperplane arrangements
1	Christopher M. Gold	Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm.	SCG	1999	DBLP DOI BibTeX RDF	crust, Voronoi diagram, skeleton, medial axis

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