|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1285 occurrences of 527 keywords
|
|
|
Results
Found 1444 publication records. Showing 1444 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Eran Eyal, Dan Halperin |
Dynamic maintenance of molecular surfaces under conformational changes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 45-54, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 32-34, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cluster, graph drawing, planarity |
1 | David Cohen-Steiner, Herbert Edelsbrunner |
Inequalities for the curvature of curves and surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 272-277, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 170-179, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 22-31, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen |
Hadwiger and Helly-type theorems for disjoint unit spheres in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 10-15, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 35-44, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 255-262, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 368-369, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
biplane geometry, topological peeling, topological walk, arrangement, geometric optimization |
1 | Yakov Nekrich |
Space efficient dynamic orthogonal range reporting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 306-313, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 190-197, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 228-236, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 73-80, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 16-21, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 380-381, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
oriented projective plane, visualization, algorithm animation, CGAL |
1 | David Eppstein, Kevin A. Wortman |
Minimum dilation stars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 321-326, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 180-189, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 346-355, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 356-363, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 91-98, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 374-375, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
animation, graph drawing |
1 | Sander Florisson, Marc J. van Kreveld, Bettina Speckmann |
Rectangular cartograms: construction & animation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 372-373, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Siu-Wing Cheng, Yajun Wang 0001, Zhuangzhi Wu |
Provable dimension detection using principal component analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 208-217, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 364-365, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 218-227, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
1 | János Pach, Gábor Tardos |
Forbidden patterns and unit distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 1-9, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 135-141, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
algorithms, approximation, set cover |
1 | Gill Barequet, Yuval Scharf, Matthew T. Dickerson |
Covering points with a polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 376-377, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
covering points |
1 | Sariel Har-Peled, Akash Kushal |
Smaller coresets for k-median and k-means clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 126-134, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
clustering, coresets |
1 | Gereon Frahling, Piotr Indyk, Christian Sohler |
Sampling in dynamic data streams and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 142-149, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
data structures, computational geometry, streaming algorithms |
1 | Dominique Attali, Herbert Edelsbrunner |
Inclusion-exclusion formulas from independent complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 247-254, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 63-72, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 237-246, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 99-106, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 263-271, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
stability, persistence, continuous functions, homology groups, combinatorial topology |
1 | Sergey Bereg, Adrian Dumitrescu |
The lifting model for reconfiguration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 55-62, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 116-125, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 150-158, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 296-305, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 278-287, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 81-90, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 336-345, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
art gallery problems, illumination problem, optimization |
1 | Efi Fogel, Dan Halperin |
Exact Minkowski sums of convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 382-383, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ajith Mascarenhas, Jack Snoeyink |
Implementing time-varying contour trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 370-371, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 160-169, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
range counting, semi-group range queries, cache-oblivious, orthogonal range searching |
1 | Tobias Lenz |
Reconstructing collections of arbitrary curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 366-367, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 107-115, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 384-385, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
collision detection, deformable models, graphics hardware, Minkowski sums |
1 | Mark de Berg |
Vertical ray shooting for fat objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 288-295, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 373-377, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Adrian Dumitrescu, János Pach |
Pushing squares around. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 116-123, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 152-159, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![ACM, 1-58113-885-7 The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 134-143, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 220-229, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
adaptive algorithms, curves |
1 | Sándor P. Fekete, Rolf Klein, Andreas Nüchter |
Searching with an autonomous robot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 449-450, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 247-252, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 273-279, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
LMS regression, approximation algorithms, lower bounds, robust statistics |
1 | Olaf A. Hall-Holt |
The corner arc algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 453-454, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
visibility, kinetic data structure, pseudo-triangulation |
1 | Günter M. Ziegler |
Random monotone paths on polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 56, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 200-209, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 263-272, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 455-456, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 451-452, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 27-35, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 230-238, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 357-365, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 290-299, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 96-105, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 253-262, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 1-9, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 330-339, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 76-85, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 320-329, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 239-246, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 366-372, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 391-400, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
continuous motion, empty ?-gon, empty hexagon |
1 | Afra Zomorodian, Gunnar E. Carlsson |
Computing persistent homology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 347-356, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
computational topology, persistent homology |
1 | Jyh-Ming Lien, Nancy M. Amato |
Approximate convex decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 457-458, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 409-418, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 340-346, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 190-199, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 46-55, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 61-67, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 383-390, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 180-189, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 210-219, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 170-179, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Delaunay triangulation update motion |
1 | Jyh-Ming Lien, Nancy M. Amato |
Approximate convex decomposition of polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 17-26, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 429-437, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 86-95, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 106-115, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 378-382, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 310-319, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 160-169, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 438-446, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 36-45, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 280-289, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 419-428, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 300-309, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
spacetime discontinuous Galerkin, adaptivity, mesh generation, tetrahedral meshes, unstructured meshes, advancing front |
Displaying result #401 - #500 of 1444 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|