ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Computational geometry: an introduction
  Purchase this Book  
Source Springer Texts And Monographs In Computer Science archive
Pages: 390  
Year of Publication: 1985
ISBN:0-387-96131-3
Authors
Franco P. Preparata  Univ. of Illinois at Urbana-Champaign, Urbana
Michael I. Shamos  Carnegie-Mellon Univ., Pittsburgh, PA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1050
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Book  

CITED BY  1,051
Guy Albertelli , Roger A. Crawfis, Efficient subdivision of finite-element datasets into consistent tetrahedra, Proceedings of the 8th conference on Visualization '97, p.213-219, October 18-24, 1997, Phoenix, Arizona, United States
Michael Garland , Andrew Willmott , Paul S. Heckbert, Hierarchical face clustering on polygonal surfaces, Proceedings of the 2001 symposium on Interactive 3D graphics, p.49-58, March 2001
Oliver G. Staadt , Markus H. Gross, Progressive tetrahedralizations, Proceedings of the conference on Visualization '98, p.397-402, October 18-23, 1998, Research Triangle Park, North Carolina, United States
K. Mulmuley, A fast planar partition algorithm, II, Proceedings of the fifth annual symposium on Computational geometry, p.33-43, June 05-07, 1989, Saarbruchen, West Germany
Chandrajit L. Bajaj , Malcolm C. Fields, The VAIDAK medical image model reconstruction toolkit, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.28-35, February 14-16, 1993, Indianapolis, Indiana, United States
Ravi Janardan , Franco P. Preparata, Widest-corridor problems, Nordic Journal of Computing, v.1 n.2, p.231-245, Summer 1994
Ibraheem Al-Furaih , Srinivas Aluru , Sanjay Goil , Sanjay Ranka, Parallel Construction of Multidimensional Binary Search Trees, IEEE Transactions on Parallel and Distributed Systems, v.11 n.2, p.136-148, February 2000
Jun-yong Noh , Ulrich Neumann, Expression cloning, Proceedings of the 28th annual conference on Computer graphics and interactive techniques, p.277-288, August 2001
Dan Halperin , Jean-Claude Latombe , Randall H. Wilson, A general framework for assembly planning: the motion space approach, Proceedings of the fourteenth annual symposium on Computational geometry, p.9-18, June 07-10, 1998, Minneapolis, Minnesota, United States
B. Chazelle , L. Palios, Triangulating a non-convex polytype, Proceedings of the fifth annual symposium on Computational geometry, p.393-400, June 05-07, 1989, Saarbruchen, West Germany
D Avis , H ElGindy, Triangulating simplicial point sets in space, Proceedings of the second annual symposium on Computational geometry, p.133-141, June 02-04, 1986, Yorktown Heights, New York, United States
Sunil Arya , David M. Mount, Approximate range searching, Proceedings of the eleventh annual symposium on Computational geometry, p.172-181, June 05-07, 1995, Vancouver, British Columbia, Canada
M. Pellegrini, Monte Carlo approximation of form factors with error bounded a priori, Proceedings of the eleventh annual symposium on Computational geometry, p.287-296, June 05-07, 1995, Vancouver, British Columbia, Canada
C. R. Bonapace , C.-Y. Lo, An O(nlogm) algorithm for VLSI design rule checking, Proceedings of the 26th ACM/IEEE conference on Design automation, p.503-507, June 25-28, 1989, Las Vegas, Nevada, United States
Antonio Corral , Yannis Manolopoulos , Yannis Theodoridis , Michael Vassilakopoulos, Closest pair queries in spatial databases, ACM SIGMOD Record, v.29 n.2, p.189-200, June 2000
Adrian Dumitrescu , William Steiger, Space-time trade-offs for some ranking and searching queries, Information Processing Letters, v.79 n.5, p.237-241, September 15, 2001
Sergei N. Bespamyatnikh, An optimal algorithm for closest pair maintenance (extended abstract), Proceedings of the eleventh annual symposium on Computational geometry, p.152-161, June 05-07, 1995, Vancouver, British Columbia, Canada
Sergei N. Bespamyatnikh, An optimal algorithm for closest pair maintenance (extended abstract), Proceedings of the eleventh annual symposium on Computational geometry, p.152-161, June 05-07, 1995, Vancouver, British Columbia, Canada
Julien Basch , Leonidas J. Guibas , John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
Pravin Vaidya, Geometry helps in matching, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.422-425, May 02-04, 1988, Chicago, Illinois, United States
Tamal K. Dey , Sumanta Guha, Algorithms for manifolds and simplicial complexes in Euclidean 3-space (preliminary version), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.398-407, May 22-24, 1996, Philadelphia, Pennsylvania, United States
John Herschberger , Subhash Suri, Offline maintenance of planar configurations, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.32-41, January 28-30, 1991, San Francisco, California, United States
Jörg Heistermann , Thomas Lengauer, Efficient automatic part nesting on irregular and inhomogeneous surfaces, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.251-259, January 25-27, 1993, Austin, Texas, United States
Philip D. MacKenzie , Quentin F. Stout, Ultra-fast expected time parallel algorithms, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.414-423, January 28-30, 1991, San Francisco, California, United States
Gregory C. Sharp , Sang W. Lee , David K. Wehe, ICP Registration Using Invariant Features, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.1, p.90-102, January 2002
Samir Khuller , Balaji Raghavachari , Neal Young, Balancing minimum spanning and shortest path trees, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.243-250, January 25-27, 1993, Austin, Texas, United States
Timothy M. Chan, Output-sensitive results on convex hulls, extreme points, and related problems, Proceedings of the eleventh annual symposium on Computational geometry, p.10-19, June 05-07, 1995, Vancouver, British Columbia, Canada
H. Edelsbrunner , N. R. Shah, Incremental topological flipping works for regular triangulations, Proceedings of the eighth annual symposium on Computational geometry, p.43-52, June 10-12, 1992, Berlin, Germany
Timothy M. Chan, A fully dynamic algorithm for planar, Proceedings of the seventeenth annual symposium on Computational geometry, p.172-176, June 2001, Medford, Massachusetts, United States
H. Edelsbrunner , L. J. Guibas , M. Sharir, The complexity of many faces in arrangements of lines of segments, Proceedings of the fourth annual symposium on Computational geometry, p.44-55, June 06-08, 1988, Urbana-Champaign, Illinois, United States
R. J. Renka, Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package, ACM Transactions on Mathematical Software (TOMS), v.22 n.1, p.1-8, March 1996
Andrew B. Kahng , Shailesh Vaya , Alexander Zelikovsky, New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout, Proceedings of the 2001 conference on Asia South Pacific design automation, p.133-138, January 2001, Yokohama, Japan
Cláudio Silva , Joseph S. B. Mitchell , Arie E. Kaufman, Fast rendering of irregular grids, Proceedings of the 1996 symposium on Volume visualization, p.15-ff., October 28-29, 1996, San Francisco, California, United States
Reuven Bar-Yehuda , Craig Gotsman, Time/space tradeoffs for polygon mesh rendering, ACM Transactions on Graphics (TOG), v.15 n.2, p.141-152, April 1996
Satyan Coorg , Seth Teller, Temporally coherent conservative visibility (extended abstract), Proceedings of the twelfth annual symposium on Computational geometry, p.78-87, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Gordon S. Novak, Jr., Software Reuse by Specialization of Generic Procedures through Views, IEEE Transactions on Software Engineering, v.23 n.7, p.401-417, July 1997
C. Wang , L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, Proceedings of the third annual symposium on Computational geometry, p.223-232, June 08-10, 1987, Waterloo, Ontario, Canada
Adam Smith , Subhash Suri, Rectangular tiling in multi-dimensional arrays, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.786-794, January 17-19, 1999, Baltimore, Maryland, United States
Mark de Berg , Matthew Katz , A. Frank van der Stappen , Jules Vleugels, Realistic input models for geometric algorithms, Proceedings of the thirteenth annual symposium on Computational geometry, p.294-303, June 04-06, 1997, Nice, France
M. J. Atallah , D. Z. Chen, Optimal parallel algorithm for visibility of a simple polygon from a point, Proceedings of the fifth annual symposium on Computational geometry, p.114-123, June 05-07, 1989, Saarbruchen, West Germany
Hongyu Chen , Changge Qiao , Feng Zhou , Chung-Kuan Cheng, Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction, Proceedings of the 2002 international workshop on System-level interconnect prediction, April 06-07, 2002, San Diego, California, USA
Mordecai J. Golin , Hyeon-Suk Na, On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes, Computational Geometry: Theory and Applications, v.25 n.3, p.197-231, July 2003
Shashi Shekhar , Chang-Tien Lu , Pusheng Zhang, Detecting graph-based spatial outliers: algorithms and applications (a summary of results), Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.371-376, August 26-29, 2001, San Francisco, California
Pankaj K. Agarwal , Sariel Har-Peled , Micha Sharir , Kasturi R. Varadarajan, Approximating shortest paths on a convex polytope in three dimensions, Journal of the ACM (JACM), v.44 n.4, p.567-584, July 1997
Alexander Brodsky, Constraint databases: promising technology or just intellectual exercise?, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
Elmar Schömer , Christian Thiel, Efficient collision detection for moving polyhedra, Proceedings of the eleventh annual symposium on Computational geometry, p.51-60, June 05-07, 1995, Vancouver, British Columbia, Canada
M. Atallah , P. Callahan , M. Goodrich, P-complete geometric problems, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.317-326, July 02-06, 1990, Island of Crete, Greece
M. Atallah , D. Chen, Parallel rectilinear shortest paths with rectangular obstacles, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.270-279, July 02-06, 1990, Island of Crete, Greece
Ivan J. Balaban, An optimal algorithm for finding segments intersections, Proceedings of the eleventh annual symposium on Computational geometry, p.211-219, June 05-07, 1995, Vancouver, British Columbia, Canada
Boris Rabinovich , Craig Gotsman, Visualization of large terrains in resource-limited computing environments, Proceedings of the 8th conference on Visualization '97, p.95-102, October 18-24, 1997, Phoenix, Arizona, United States
Miguel Felder , Angelo Morzenti, Validating real-time systems by history-checking TRIO specifications, Proceedings of the 14th international conference on Software engineering, p.199-211, May 11-15, 1992, Melbourne, Australia
David Dobkin , Leonidas Guibas , John Hershberger , Jack Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon, ACM SIGGRAPH Computer Graphics, v.22 n.4, p.31-40, Aug. 1988
J. H. Reif , S. Sen, An efficient output-sensitive hidden surface removal algorithm and its parallelization, Proceedings of the fourth annual symposium on Computational geometry, p.193-200, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Ken Perlin , David Fox, Pad: an alternative approach to the computer interface, Proceedings of the 20th annual conference on Computer graphics and interactive techniques, p.57-64, September 1993
Jean-Daniel Boissonnat , Micha Sharir , Boaz Tagansky , Mariette Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, Proceedings of the eleventh annual symposium on Computational geometry, p.79-88, June 05-07, 1995, Vancouver, British Columbia, Canada
Danny Z. Chen, An optimal parallel algorithm for detecting weak visibility of a simple polygon, Proceedings of the eighth annual symposium on Computational geometry, p.63-72, June 10-12, 1992, Berlin, Germany
Ioannis Emiris , John Canny, An efficient approach to removing geometric degeneracies, Proceedings of the eighth annual symposium on Computational geometry, p.74-82, June 10-12, 1992, Berlin, Germany
Yossi Matias , Jeffrey Scott Vitter , Min Wang, Wavelet-based histograms for selectivity estimation, ACM SIGMOD Record, v.27 n.2, p.448-459, June 1998
Stephen Alstrup , Gerth Brodal , Theis Rauhe, Optimal static range reporting in one dimension, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.476-482, July 2001, Hersonissos, Greece
Stefan Berchtold , Christian Böhm , Daniel A. Keim , Hans-Peter Kriegel, A cost model for nearest neighbor search in high-dimensional data space, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.78-86, May 11-15, 1997, Tucson, Arizona, United States
J. Hershberger , S. Suri, Finding tailored partitions, Proceedings of the fifth annual symposium on Computational geometry, p.255-265, June 05-07, 1989, Saarbruchen, West Germany
Danny Z. Chen , Kevin S. Klenk , Hung-Yi T. Tu, Shortest path queries among weighted obstacles in the rectilinear plane, Proceedings of the eleventh annual symposium on Computational geometry, p.370-379, June 05-07, 1995, Vancouver, British Columbia, Canada
George Vaněček, Jr., BRep-Index: a multidimensional space partitioning tree, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.35-44, June 05-07, 1991, Austin, Texas, United States
Sergei N. Bespamyatnikh, An efficient algorithm for the three-dimensional diameter problem, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.137-146, January 25-27, 1998, San Francisco, California, United States
Parivallal Kannan , Shankar Balachandran , Dinesh Bhatia, On metrics for comparing routability estimation methods for FPGAs, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA
M. Gangnet , J.-C. Hervé , T. Pudet , J.-M. van Thong, Incremental computation of planar maps, ACM SIGGRAPH Computer Graphics, v.23 n.3, p.345-354, July 1989
Lin-Lin Chen , Shuo-Yan Chou , Tony C. Woo, Separating and intersecting spherical polygons: computing machinability on three-, four-, and five-axis numerically controlled machines, ACM Transactions on Graphics (TOG), v.12 n.4, p.305-326, Oct. 1993
Helmut Alt , Otfried Schwarzkopf, The Voronoi diagram of curved objects, Proceedings of the eleventh annual symposium on Computational geometry, p.89-97, June 05-07, 1995, Vancouver, British Columbia, Canada
Günther Greiner , Kai Hormann, Efficient clipping of arbitrary polygons, ACM Transactions on Graphics (TOG), v.17 n.2, p.71-83, April 1998
B. Chazelle , H. Edelsbrunner , L. Guibas , M. Sharir, Lines in space-combinators, algorithms and applications, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.382-393, May 14-17, 1989, Seattle, Washington, United States
S.-J. Oh , M. Suk, Parallel algorithms for geometric searching problems, Proceedings of the 1989 ACM/IEEE conference on Supercomputing, p.344-350, November 12-17, 1989, Reno, Nevada, United States
Andrew B. Kahng, Classical floorplanning harmful?, Proceedings of the 2000 international symposium on Physical design, p.207-213, May 2000, San Diego, California, United States
Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.457-465, January 17-19, 1999, Baltimore, Maryland, United States
Ashish Goel , Piotr Indyk , Kasturi Varadarajan, Reductions among high dimensional proximity problems, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.769-778, January 07-09, 2001, Washington, D.C., United States
Nancy M. Amato , Michael T. Goodrich , Edgar A. Ramos, Linear-time triangulation of a simple polygon made easier via randomization, Proceedings of the sixteenth annual symposium on Computational geometry, p.201-212, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
D. E. Willard , Y. C. Wee, Quasi-Valid range querying and its implications for nearest neighbor problems, Proceedings of the fourth annual symposium on Computational geometry, p.34-43, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Shi-Nine Yang , Ming-Liang Huang, A new offsetting algorithm based on tracing technique, Proceedings on the second ACM symposium on Solid modeling and applications, p.201-210, May 19-21, 1993, Montreal, Quebec, Canada
Pankaj K. Agarwal , Herbert Edelsbrunner , Otfried Schwarzkopf , Emo Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Proceedings of the sixth annual symposium on Computational geometry, p.203-210, June 07-09, 1990, Berkley, California, United States
Abbas Edalat , André Lieutier, Foundation of a computable solid modeling, Proceedings of the fifth ACM symposium on Solid modeling and applications, p.278-284, June 08-11, 1999, Ann Arbor, Michigan, United States
Alex C.-C. Meng , Vytas B. Gylys, A methodology of autonomous navigation in 3-D space under location uncertainty, Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems, p.605-619, June 1988, Tullahoma, Tennessee, United States
Oliver G. Staadt , Markus H. Gross , Roger Weber, Multiresolution compression and reconstruction, Proceedings of the 8th conference on Visualization '97, p.337-ff., October 18-24, 1997, Phoenix, Arizona, United States
Leila De Floriani , Enrico Puppo, Hierarchical triangulation for multiresolution surface description, ACM Transactions on Graphics (TOG), v.14 n.4, p.363-411, Oct. 1995
Sanjiv Kapoor, Dynamic maintenance of maximas of 2-d point sets, Proceedings of the tenth annual symposium on Computational geometry, p.140-149, June 06-08, 1994, Stony Brook, New York, United States
E. Schrik , N. P. van der Meijs, Combined BEM/FEM substrate resistance modeling, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA
Marek Teichmann , Michael Capps, Surface reconstruction with anisotropic density-scaled alpha shapes, Proceedings of the conference on Visualization '98, p.67-72, October 18-23, 1998, Research Triangle Park, North Carolina, United States
F. Hendriks, APL and finite elements for solving convection-diffusion problems, with examples from gas bearing design, ACM SIGAPL APL Quote Quad, v.18 n.2, p.169-177, Dec. 1987
Clifford So , George Baciu , Hanqiu Sun, Reconstruction of 3D virtual buildings from 2D architectural floor plans, Proceedings of the ACM symposium on Virtual reality software and technology, p.17-23, November 02-05, 1998, Taipei, Taiwan
Herbert Edelsbrunner , Tiow Seng Tan, An upper bound for conforming Delaunay triangulations, Proceedings of the eighth annual symposium on Computational geometry, p.53-62, June 10-12, 1992, Berlin, Germany
Hisamoto Hiyoshi , Kokichi Sugihara, Voronoi-based interpolation with higher continuity, Proceedings of the sixteenth annual symposium on Computational geometry, p.242-250, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Thomas Seidl , Hans-Peter Kriegel, Optimal multi-step k-nearest neighbor search, ACM SIGMOD Record, v.27 n.2, p.154-165, June 1998
Joseph Hummel , Laurie J. Hendren , Alexandru Nicolau, A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices, v.29 n.6, p.218-229, June 1994
P. Cignoni , C. Montani , E. Puppo , R. Scopigno, Optimal isosurface extraction from irregular volume data, Proceedings of the 1996 symposium on Volume visualization, p.31-38, October 28-29, 1996, San Francisco, California, United States
John Hershberger , Subhash Suri, Kinetic connectivity of rectangles, Proceedings of the fifteenth annual symposium on Computational geometry, p.237-246, June 13-16, 1999, Miami Beach, Florida, United States
Lee Markosian , Michael A. Kowalski , Daniel Goldstein , Samuel J. Trychin , John F. Hughes , Lubomir D. Bourdev, Real-time nonphotorealistic rendering, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, p.415-420, August 1997
Jim Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.83-92, January 25-27, 1993, Austin, Texas, United States
Christian Schwarz , Michiel Smid , Jack Snoeyink, An optimal algorithm for the on-line closest-pair problem, Proceedings of the eighth annual symposium on Computational geometry, p.330-336, June 10-12, 1992, Berlin, Germany
Han-Ming Chen , Wen-Teng Wang, The feudal priority algorithm on hidden-surface removal, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, p.55-64, August 1996
Piotr Berman , Andrew B. Kahng , Devendra Vidhani , Huijuan Wang , Alex Zelikovsky, Optimal phase conflict removal for layout of dark field alternating phase shifting masks, Proceedings of the 1999 international symposium on Physical design, p.121-126, April 12-14, 1999, Monterey, California, United States
Jon Louis Bentley, Experiments on traveling salesman heuristics, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.91-99, January 22-24, 1990, San Francisco, California, United States
D. T. Lee , T. H. Chen , C. D. Yang, Shortest rectilinear paths among weighted obstacles, Proceedings of the sixth annual symposium on Computational geometry, p.301-310, June 07-09, 1990, Berkley, California, United States
Paul Haeberli, Paint by numbers: abstract image representations, ACM SIGGRAPH Computer Graphics, v.24 n.4, p.207-214, Aug. 1990
Michael B. Dillencourt , Warren D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, Proceedings of the eighth annual symposium on Computational geometry, p.177-185, June 10-12, 1992, Berlin, Germany
Paul de Dood , John Wawrzynek , Erwin Liu , Roberto Suaya, A two-dimensional topological compactor with octagonal geometry, Proceedings of the 28th conference on ACM/IEEE design automation, p.727-731, June 17-22, 1991, San Francisco, California, United States
Paris Kanellakis, Constraint programming and database languages: a tutorial, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.46-53, May 22-25, 1995, San Jose, California, United States
D E Willard, On the application of sheared retrieval to orthogonal range queries, Proceedings of the second annual symposium on Computational geometry, p.80-89, June 02-04, 1986, Yorktown Heights, New York, United States
Philip M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM Transactions on Graphics (TOG), v.15 n.3, p.179-210, July 1996
James Arvo , David Kirk, Fast ray tracing by ray classification, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.55-64, July 1987
Kenji Shimada , David C. Gossard, Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing, Proceedings of the third ACM symposium on Solid modeling and applications, p.409-419, May 17-19, 1995, Salt Lake City, Utah, United States
Yossi Matias , Jeffrey Scott Vitter , Neal E. Young, Approximate data structures with applications, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.187-194, January 23-25, 1994, Arlington, Virginia, United States
Sanghyun Park , Sang-Wook Kim , June-Suh Cho , Sriram Padmanabhan, Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
Siu Wing Cheng , Ravi Janardan, Efficient maintenance of the union intervals on a line, with applications, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.74-83, January 22-24, 1990, San Francisco, California, United States
William C. Thibault , Bruce F. Naylor, Set operations on polyhedra using binary space partitioning trees, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.153-162, July 1987
Jon L. Bentley , Kenneth L. Clarkson , David B. Levine, Fast linear expected-time alogorithms for computing maxima and convex hulls, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.179-187, January 22-24, 1990, San Francisco, California, United States
Rolf Klein , Andrzej Lingas, Manhattonian proximity in a simple polygon, Proceedings of the eighth annual symposium on Computational geometry, p.312-319, June 10-12, 1992, Berlin, Germany
Walid G. Aref , Hanan Samet, Cascaded spatial join algorithms with spatially sorted output, Proceedings of the 4th ACM international workshop on Advances in geographic information systems, p.17-24, November 1996, Rockville, Maryland, United States
Michael A. Riepe , Karem A. Sakallah, The edge-based design rule model revisited, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.3 n.3, p.463-486, July 1998
Mark Overmars , Anil Rao , Otfried Schwarzkopf , Chantal Wentink, Immobilizing polygons against a wall, Proceedings of the eleventh annual symposium on Computational geometry, p.29-38, June 05-07, 1995, Vancouver, British Columbia, Canada
P. D. Alevizos , J. Boissonnat , M. Yvinec, An optimal O(n log n) algorithm for contour reconstruction from rays, Proceedings of the third annual symposium on Computational geometry, p.162-170, June 08-10, 1987, Waterloo, Ontario, Canada
David Eppstein, Average case analysis of dynamic geometric optimization, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.77-86, January 23-25, 1994, Arlington, Virginia, United States
Naoki Katoh , Kazuo Iwano, Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane, Proceedings of the eighth annual symposium on Computational geometry, p.320-329, June 10-12, 1992, Berlin, Germany
Pankaj K. Agarwal , Micha Sharir, Planar geometric location problems and maintaining the width of a planar set, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.449-458, January 28-30, 1991, San Francisco, California, United States
M. Golin , R. Sedgewick, Analysis of a simple yet efficient convex hull algorithm, Proceedings of the fourth annual symposium on Computational geometry, p.153-163, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Paul B. Callahan , S. Rao Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.291-300, January 25-27, 1993, Austin, Texas, United States
Ernst P. Mücke , Isaac Saias , Binhai Zhu, Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations, Proceedings of the twelfth annual symposium on Computational geometry, p.274-283, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Amir M. Ben-Amram , Omer Berkman , Costas S. Iliopoulos , Kunsoo Park, The subtree max gap problem with application to parallel string covering, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.501-510, January 23-25, 1994, Arlington, Virginia, United States
V. Chandru , R. Venkataraman, Circular hulls and orbiforms of simple polygons, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.433-440, January 28-30, 1991, San Francisco, California, United States
C. Monma , M. Paterson , S. Suri , F. Yao, Computing Euclidean maximum spanning trees, Proceedings of the fourth annual symposium on Computational geometry, p.241-251, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Thomas F. Hain , Somnath Gulve, Interactive, visual testing strategy for computational geometry problems, Proceedings of the 36th annual Southeast regional conference, p.310-313, April 1998
Mujtaba R. Ghouse , Michael T. Goodrich, In-place techniques for parallel convex hull algorithms (preliminary version), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.192-203, July 21-24, 1991, Hilton Head, South Carolina, United States
Dimitris Papadias , Nikos Mamoulis , Vasilis Delis, Approximate spatio-temporal retrieval, ACM Transactions on Information Systems (TOIS), v.19 n.1, p.53-96, Jan. 2001
Stéphane Grumbach , Philippe Rigaux , Luc Segoufin, The DEDALE system for complex spatial queries, ACM SIGMOD Record, v.27 n.2, p.213-224, June 1998
Roberto Tamassia, Strategic directions in computational geometry, ACM Computing Surveys (CSUR), v.28 n.4, p.591-606, Dec. 1996
S. R. Ala, Design methodology of boundary data structures, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.13-23, June 05-07, 1991, Austin, Texas, United States
Subhash Suri , Philip M. Hubbard , John F. Hughes, Collision detection in aspect and scale bounded polyhedra, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.127-136, January 25-27, 1998, San Francisco, California, United States
Monica Bianchini , Stefano Fanelli , Marco Gori, Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations, IEEE Transactions on Computers, v.50 n.7, p.689-698, July 2001
Jayanth Majhi , Ravi Janardan , Michiel Smid , Jörg Schwerdt, Multi-criteria geometric optimization problems in layered manufacturing, Proceedings of the fourteenth annual symposium on Computational geometry, p.19-28, June 07-10, 1998, Minneapolis, Minnesota, United States
Jesús García-López , Pedro A. Ramos, Fitting a set of points by a circle, Proceedings of the thirteenth annual symposium on Computational geometry, p.139-146, June 04-06, 1997, Nice, France
Hee-Kap Ahn , Mark de Berg , Prosenjit Bose , Siu-Wing Cheng , Dan Halperin , Jiří Matoušek , Otfried Schwarzkopf, Separating an object from its cast, Proceedings of the thirteenth annual symposium on Computational geometry, p.221-230, June 04-06, 1997, Nice, France
Hai Zhou , Narendra Shenoy , William Nicholls, Efficient minimum spanning tree construction without Delaunay triangulation, Proceedings of the 2001 conference on Asia South Pacific design automation, p.192-197, January 2001, Yokohama, Japan
Frank Dehne , Xiaotie Deng , Patrick Dymond , Andreas Fabri , Ashfaq A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.27-33, June 24-26, 1995, Santa Barbara, California, United States
Tetsuo Asano , Antonio Hernández-Barrera , Subhas C. Nandy, Translating a convex polyhedron over monotone polyhedra, Computational Geometry: Theory and Applications, v.23 n.3, p.257-269, November 2002
Kentan Mulmuley, A fast planar partition algorithm, II, Journal of the ACM (JACM), v.38 n.1, p.74-103, Jan. 1991
Giuseppe Liotta , Henk Meijer, Voronoi drawings of trees, Computational Geometry: Theory and Applications, v.24 n.3, p.147-178, April 2003
Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998
Edoardo Charbon , Ilhami Torunoglu, Copyright protection of designs based on multi source IPs, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.591-595, November 07-11, 1999, San Jose, California, United States
Venkatavasu Bokka , Koji Nakano , Stephen Olariu , James L. Schwing , Larry Wilson, Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications, IEEE Transactions on Parallel and Distributed Systems, v.12 n.9, p.875-887, September 2001
A. James Stewart, Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications, IEEE Transactions on Visualization and Computer Graphics, v.4 n.1, p.82-93, January 1998
Guy E. Blelloch , Gary L. Miller , Dafna Talmor, Developing a practical projection-based parallel Delaunay algorithm, Proceedings of the twelfth annual symposium on Computational geometry, p.186-195, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Fenglien Lee, Constructing the constrained Delaunay triangulation on the Intel paragon, Proceedings of the 1997 ACM symposium on Applied computing, p.464-467, April 1997, San Jose, California, United States
Gene Myers , Webb Miller, Chaining multiple-alignment fragments in sub-quadratic time, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.38-47, January 22-24, 1995, San Francisco, California, United States
Marshall Bern , Scott Mitchell , Jim Ruppert, Linear-size nonobtuse triangulation of polygons, Proceedings of the tenth annual symposium on Computational geometry, p.221-230, June 06-08, 1994, Stony Brook, New York, United States
Cynthia A. Phillips, The network inhibition problem, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.776-785, May 16-18, 1993, San Diego, California, United States
Sanjiv Kapoor , Michiel Smid, New techniques for exact and approximate dynamic closest-point problems, Proceedings of the tenth annual symposium on Computational geometry, p.165-174, June 06-08, 1994, Stony Brook, New York, United States
Seth J. Teller, Visualizing fortune's sweepline algorithm for planar Voronoi diagrams, Proceedings of the ninth annual symposium on Computational geometry, p.393, May 18-21, 1993, San Diego, California, United States
Xiaolin Wu, Color quantization by dynamic programming and principal analysis, ACM Transactions on Graphics (TOG), v.11 n.4, p.348-372, Oct. 1992
Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter, Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.685-694, January 25-27, 1998, San Francisco, California, United States
Scott Epter , Mukkai Krishnamoorthy, A multiple-resolution method for edge-centric data clustering, Proceedings of the eighth international conference on Information and knowledge management, p.491-498, November 02-06, 1999, Kansas City, Missouri, United States
John Canny , Bruce Donald , Eugene K. Ressler, A rational rotation method for robust geometric algorithms, Proceedings of the eighth annual symposium on Computational geometry, p.251-260, June 10-12, 1992, Berlin, Germany
Tamal K. Dey , Sumanta Guha, Computing homology groups of simplicial complexes in R3, Journal of the ACM (JACM), v.45 n.2, p.266-287, March 1998
Michael T. Goodrich , Steven B. Shauck , Sumanta Guha, Parallel methods for visibility and shortest path problems in simple polygons (preliminary version), Proceedings of the sixth annual symposium on Computational geometry, p.73-82, June 07-09, 1990, Berkley, California, United States
Herbert Edelsbrunner , Ernst Peter Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics (TOG), v.9 n.1, p.66-104, Jan. 1990
Yuan-Chi Chang , Lawrence Bergman , Vittorio Castelli , Chung-Sheng Li , Ming-Ling Lo , John R. Smith, The onion technique: indexing for linear optimization queries, ACM SIGMOD Record, v.29 n.2, p.391-402, June 2000
Amir M. Ben-Amram , Zvi Galil, On pointers versus addresses, Journal of the ACM (JACM), v.39 n.3, p.617-648, July 1992
L. J. Guibas , J. Hershberger, Optimal shortest path queries in a simple polygon, Proceedings of the third annual symposium on Computational geometry, p.50-63, June 08-10, 1987, Waterloo, Ontario, Canada
Dan Halperin , Christian R. Shelton, A perturbation scheme for spherical arrangements with application to molecular modeling, Proceedings of the thirteenth annual symposium on Computational geometry, p.183-192, June 04-06, 1997, Nice, France
Ravindra Jejurikar , Rajesh Gupta, Energy aware task scheduling with task synchronization for embedded real time systems, Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems, October 08-11, 2002, Grenoble, France
Lutz Plümer , Gerhard Gröger, Nested maps—a formal, provably correct object model for spatial aggregates, Proceedings of the 4th ACM international workshop on Advances in geographic information systems, p.76-83, November 1996, Rockville, Maryland, United States
J. Painter , K. Sloan, Antialiased ray tracing by adaptive progressive refinement, ACM SIGGRAPH Computer Graphics, v.23 n.3, p.281-288, July 1989
Haklin Kimm, Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system, Proceedings of the 1998 ACM symposium on Applied Computing, p.623-627, February 27-March 01, 1998, Atlanta, Georgia, United States
Matthew Dickerson , Daniel Scharstein, Optimal placement of convex polygons to maximize point containment, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.114-121, January 28-30, 1996, Atlanta, Georgia, United States
Mihai Pop , Christian Duncan , Gill Barequet , Michael Goodrich , Wenjing Huang , Subodh Kumar, Efficient perspective-accurate silhouette computation and applications, Proceedings of the seventeenth annual symposium on Computational geometry, p.60-68, June 2001, Medford, Massachusetts, United States
Yannis Theodoridis , Emmanuel Stefanakis , Timos Sellis, Efficient Cost Models for Spatial Queries Using R-Trees, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.19-32, January 2000
Kenneth J. Supowit, New techniques for some dynamic closest-point and farthest-point problems, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.84-90, January 22-24, 1990, San Francisco, California, United States
Allan Hansen , Farhad Arbab, An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands, ACM Transactions on Graphics (TOG), v.11 n.2, p.152-182, April 1992
Timothy M. Chan, Semi-online maintenance of geometric optima and measures, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.474-483, January 06-08, 2002, San Francisco, California
Udi Manber, Using induction to design algorithms, Communications of the ACM, v.31 n.11, p.1300-1313, Nov. 1988
David Eppstein, Incremental and decremental maintenance of planar width, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.899-900, January 17-19, 1999, Baltimore, Maryland, United States
Thomas Dubé, Dominance range-query: the one-reporting case, Proceedings of the ninth annual symposium on Computational geometry, p.208-217, May 18-21, 1993, San Diego, California, United States
Michael T. Goodrich , Roberto Tamassia, Dynamic trees and dynamic point location, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.523-533, May 05-08, 1991, New Orleans, Louisiana, United States
Jon Louis Bentley, K-d trees for semidynamic point sets, Proceedings of the sixth annual symposium on Computational geometry, p.187-197, June 07-09, 1990, Berkley, California, United States
Yunhong Zhou , Subhash Suri, Analysis of a bounding box heuristic for object intersection, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.830-839, January 17-19, 1999, Baltimore, Maryland, United States
Chandrajit L. Bajaj , Fausto Bernardini , Guoliang Xu, Automatic reconstruction of surfaces and scalar fields from 3D scans, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.109-118, September 1995
Jorge Urrutia, Routing with guaranteed delivery in geometric and wireless networks, Handbook of wireless networks and mobile computing, John Wiley & Sons, Inc., New York, NY, 2002
Scott A. Mitchell , Stephen A. Vavasis, Quality mesh generation in three dimensions, Proceedings of the eighth annual symposium on Computational geometry, p.212-221, June 10-12, 1992, Berlin, Germany
S. Gottschalk , M. C. Lin , D. Manocha, OBBTree: a hierarchical structure for rapid interference detection, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, p.171-180, August 1996
Guy A. Schiavone , S. Sureshchandran , Kenneth C. Hardis, Terrain database interoperability issues in training with distributed interactive simulation, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.7 n.3, p.332-367, July 1997
Robert Blanding , Cole Brooking , Mark Ganter , Duane Storti, A skeletal-based solid editor, Proceedings of the fifth ACM symposium on Solid modeling and applications, p.141-150, June 08-11, 1999, Ann Arbor, Michigan, United States
M. Dillencourt, Toughness and Delaunay triangulations, Proceedings of the third annual symposium on Computational geometry, p.186-194, June 08-10, 1987, Waterloo, Ontario, Canada
Subhajit Sen , Si-Qing Zheng, Near-optimal triangulation of a point set by simulated annealing, Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, p.1000-1008, March 1992, Kansas City, Missouri, United States
J. Ruppert , R. Seidel, On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra, Proceedings of the fifth annual symposium on Computational geometry, p.380-392, June 05-07, 1989, Saarbruchen, West Germany
Ari Rappoport , Steven Spitz, Interactive Boolean operations for conceptual design of 3-D solids, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, p.269-278, August 1997
Dan Halperin , Mark H. Overmars, Spheres, molecules, and hidden surface removal, Proceedings of the tenth annual symposium on Computational geometry, p.113-122, June 06-08, 1994, Stony Brook, New York, United States
Pankaj K. Agarwal , Subhash Suri, Surface approximation and geometric partitions, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.24-33, January 23-25, 1994, Arlington, Virginia, United States
Leila De Floriani , Paola Magillo , Enrico Puppo, Compressing TINs, Proceedings of the 6th ACM international symposium on Advances in geographic information systems, p.145-150, November 02-07, 1998, Washington, D.C., United States
D. M. Mount , A. Saalfeld, Globally-Equiangular triangulations of co-circular points in 0(n log n) time, Proceedings of the fourth annual symposium on Computational geometry, p.143-152, June 06-08, 1988, Urbana-Champaign, Illinois, United States
B. Aronov , S. Fortune , G. Wilfong, The furthest-site geodesic Voronoi diagram, Proceedings of the fourth annual symposium on Computational geometry, p.229-240, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Mikhail J. Atallah , Hubert Wagener , Danny Z. Chen, An optimal parallel algorithm for the visibility of a simple polygon from a point, Journal of the ACM (JACM), v.38 n.3, p.515-532, July 1991
Paul B. Callahan , S. Rao Kosaraju, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, Journal of the ACM (JACM), v.42 n.1, p.67-90, Jan. 1995
Danny Z. Chen , Ovidiu Daescu , Xiaobo (Sharon) Hu , Xiaodong Wu , Jinhui Xu, Determining an optimal penetration among weighted regions in two and three dimensions, Proceedings of the fifteenth annual symposium on Computational geometry, p.322-331, June 13-16, 1999, Miami Beach, Florida, United States
Gavin Miller, Efficient algorithms for local and global accessibility shading, Proceedings of the 21st annual conference on Computer graphics and interactive techniques, p.319-326, July 1994
Ying Xu , Dong Xu , Oakley H. Crawford , J. Ralph Einstein , Engin Serpersu, Protein structure determination using protein threading and sparse NMR data (extended abstract), Proceedings of the fourth annual international conference on Computational molecular biology, p.299-307, April 2000, Tokyo, Japan
Timothy M. Chan, Approximate nearest neighbor queries revisited, Proceedings of the thirteenth annual symposium on Computational geometry, p.352-358, June 04-06, 1997, Nice, France
Sergio Cabello , Yuanxin Liu , Andrea Mantler , Jack Snoeyink, Testing Homotopy for paths in the plane, Proceedings of the eighteenth annual symposium on Computational geometry, p.160-169, June 05-07, 2002, Barcelona, Spain
Jie Gao , Leonidas J. Guibas , John Hershberger , Li Zhang , An Zhu, Geometric spanner for routing in mobile networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA
Jignesh M. Patel , David J. DeWitt, Partition based spatial-merge join, ACM SIGMOD Record, v.25 n.2, p.259-270, June 1996
Luc Devroye, Generation of random objects, Proceedings of the 24th conference on Winter simulation, p.270-279, December 13-16, 1992, Arlington, Virginia, United States
Jiří Matoušek, Range searching with efficient hierarchical cuttings, Proceedings of the eighth annual symposium on Computational geometry, p.276-285, June 10-12, 1992, Berlin, Germany
Timothy M. Chan, Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus, Proceedings of the sixteenth annual symposium on Computational geometry, p.300-309, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Nancy M. Amato, Equipping CAD/CAM systems with geometric intelligence, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
Jörg Schwerdt , Michiel Smid , Stefan Schirra, Computing the minimum diameter for moving points: an exact implementation using parametric search, Proceedings of the thirteenth annual symposium on Computational geometry, p.466-468, June 04-06, 1997, Nice, France
P. Egyed , R. Wenger, Stabbing pairwise disjoint translates in linear time, Proceedings of the fifth annual symposium on Computational geometry, p.364-369, June 05-07, 1989, Saarbruchen, West Germany
J. Ph. Diguet , S. Wuytack , F. Catthoor , H. De Man, Formalized methodology for data reuse exploration in hierarchical memory mappings, Proceedings of the 1997 international symposium on Low power electronics and design, p.30-35, August 18-20, 1997, Monterey, California, United States
John Hershberger , Subhash Suri, Practical methods for approximating shortest paths on a convex polytope in R3, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.447-456, January 22-24, 1995, San Francisco, California, United States
Roger Bush , Carlo Sèquin, Synthesis of bent sheet metal parts from design features, Proceedings of the fifth ACM symposium on Solid modeling and applications, p.119-129, June 08-11, 1999, Ann Arbor, Michigan, United States
Thomas Kämpke, The geometry of linear infeasibility, Applied Mathematics and Computation, v.129 n.2-3, p.317-337, 10 July 2002
Danny Z. Chen , Ovidiu Daescu , Yang Dai , Naoki Katoh , Xiadong Wu , Jinhui Xu, Optimizing the sum of linear fractional functions and applications, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.707-716, January 09-11, 2000, San Francisco, California, United States
Gary A. Hyslop , Edmund A. Lamagna, Error free incremental construction of Voronoi diagrams in the plane, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.388-396, February 14-16, 1993, Indianapolis, Indiana, United States
R Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.404-413, May 28-30, 1986, Berkeley, California, United States
Amit Reisman , Craig Gotsman , Assaf Schuster, Parallel progressive rendering of animation sequences at interactive rates on distributed-memory machines, Proceedings of the IEEE symposium on Parallel rendering, p.39-47, October 20-21, 1997, Phoenix, Arizona, United States
L. P. Chew, Constrained Delaunay triangulations, Proceedings of the third annual symposium on Computational geometry, p.215-222, June 08-10, 1987, Waterloo, Ontario, Canada
Steven J. Fortune , David M. Gay , Brian W. Kernighan , Orlando Landron , Reinaldo A. Valenzuela , Margaret H. Wright, WISE Design of Indoor Wireless Systems: Practical Computation and Optimization, IEEE Computational Science & Engineering, v.2 n.1, p.58-68, March 1995
Tsung-Pao Fang , Les A. Piegl, Delaunay Triangulation Using a Uniform Grid, IEEE Computer Graphics and Applications, v.13 n.3, p.36-47, May 1993
Danny Z. Chen, On the all-pairs Euclidean short path problem, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.292-301, January 22-24, 1995, San Francisco, California, United States
Masato Edahiro, An efficient zero-skew routing algorithm, Proceedings of the 31st annual conference on Design automation, p.375-380, June 06-10, 1994, San Diego, California, United States
Guy E. Blelloch, Programming parallel algorithms, Communications of the ACM, v.39 n.3, p.85-97, March 1996
C Levcopoulos, Fast heuristics for minimum length rectangular partitions of polygons, Proceedings of the second annual symposium on Computational geometry, p.100-108, June 02-04, 1986, Yorktown Heights, New York, United States
Michael T. Goodrich, Constructing arrangements optimally in parallel (preliminary version), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.169-179, July 21-24, 1991, Hilton Head, South Carolina, United States
Pankaj K. Agarwal , Prabhakar Raghavan , Hisao Tamaki, Motion planning for a steering-constrained robot through moderate obstacles, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.343-352, May 29-June 01, 1995, Las Vegas, Nevada, United States
C.-Y. Lo, Automatic tub region generation for symbolic layout compaction, Proceedings of the 26th ACM/IEEE conference on Design automation, p.302-306, June 25-28, 1989, Las Vegas, Nevada, United States
A. Aguilera , D. Ayala, Orthogonal polyhedra as geometric bounds in constructive solid geometry, Proceedings of the fourth ACM symposium on Solid modeling and applications, p.56-67, May 14-16, 1997, Atlanta, Georgia, United States
Timothy M. Chan, Dynamic planar convex hull operations in near-logarithmic amortized time, Journal of the ACM (JACM), v.48 n.1, p.1-12, Jan. 2001
Mordecai J. Golin , Hyeon-Suk Na, The probabilistic complexity of the Voronoi diagram of points on a polyhedron, Proceedings of the eighteenth annual symposium on Computational geometry, p.209-216, June 05-07, 2002, Barcelona, Spain
Collette Coullard , Anna Lubiw, Distance visibility graphs, Proceedings of the seventh annual symposium on Computational geometry, p.289-296, June 10-12, 1991, North Conway, New Hampshire, United States
Xuehou Tan, Optimal computation of the Voronoi diagram of disjoint clusters, Information Processing Letters, v.79 n.3, p.115-119, 07/31/2001
Stephen Cameron, Approximation hierarchies and S-bounds, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.129-137, June 05-07, 1991, Austin, Texas, United States
Z. W. Wang , S. K. M. Wong , Y. Y. Yao, An analysis of vector space models based on computational geometry, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.152-160, June 21-24, 1992, Copenhagen, Denmark
Jonathan Goldstein , Raghu Ramakrishnan , Uri Shaft , Jie-Bing Yu, Processing queries by linear constraints, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.257-267, May 11-15, 1997, Tucson, Arizona, United States
Jean-Daniel Boissonnat , Jack Snoeyink, Efficient algorithms for line and curve segment intersection using restricted predicates, Proceedings of the fifteenth annual symposium on Computational geometry, p.370-379, June 13-16, 1999, Miami Beach, Florida, United States
Yi-Jen Chiang , Franco P. Preparata , Roberto Tamassia, A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.44-53, January 25-27, 1993, Austin, Texas, United States
Pankaj K. Agarwal , Pavan K. Desikan, An efficient algorithm for terrain simplification, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.139-147, January 05-07, 1997, New Orleans, Louisiana, United States
Herbert Edelsbrunner , Tiow Seng Tan , Roman Waupotitsch, An O(n2log n) time algorithm for the MinMax angle triangulation, Proceedings of the sixth annual symposium on Computational geometry, p.44-52, June 07-09, 1990, Berkley, California, United States
Lin Yu , Daniel J. Rosenkrantz, A linear-time scheme for version reconstruction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.775-797, May 1994
Peter J. C. Brown, Intelligent transmission of 3D polygonal models, ACM SIGGRAPH 97 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '97, p.176, August 03-08, 1997, Los Angeles, California, United States
Biing-Feng Wang , Shan-Chyun Ku , Keng-Hua Shil, Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems, IEEE Transactions on Parallel and Distributed Systems, v.12 n.9, p.888-898, September 2001
Greg Turk, Re-tiling polygonal surfaces, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.55-64, July 1992
Alexandra Solan, Cutting cylces of rods in space, Proceedings of the fourteenth annual symposium on Computational geometry, p.135-142, June 07-10, 1998, Minneapolis, Minnesota, United States
Matthew J. Katz , Mark H. Overmars , Micha Shairr, Efficient hidden surface removal for objects with small union size, Proceedings of the seventh annual symposium on Computational geometry, p.31-40, June 10-12, 1991, North Conway, New Hampshire, United States
Gary L. Miller , Dafna Talmor , Shang-Hua Teng , Noel Walkington, A Delaunay based numerical method for three dimensions: generation, formulation, and partition, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.683-692, May 29-June 01, 1995, Las Vegas, Nevada, United States
Sariel Har-Peled , Micha Sharir , Kasturi R. Varadarajan, Approximating shortest paths on a convex polytope in three dimensions, Proceedings of the twelfth annual symposium on Computational geometry, p.329-338, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Andrew B. Kahng , Gabriel Robins , Anish Singh , Huijuan Wang , Alexander Zelikovsky, Filling and slotting: analysis and algorithms, Proceedings of the 1998 international symposium on Physical design, p.95-102, April 06-08, 1998, Monterey, California, United States
Stefan Berchtold , Christian Böhm , Bernhard Braunmüller , Daniel A. Keim , Hans-Peter Kriegel, Fast parallel similarity search in multimedia databases, ACM SIGMOD Record, v.26 n.2, p.1-12, June 1997
Marcelo Walter , Alain Fournier , Daniel Menevaux, Integrating shape and pattern in mammalian models, Proceedings of the 28th annual conference on Computer graphics and interactive techniques, p.317-326, August 2001
T. Tamassia , J. S. Vitter, Optimal cooperative search in fractional cascaded data structures, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.307-316, July 02-06, 1990, Island of Crete, Greece
Nikhil Gagvani , Deborah Silver, Shape-based volumetric collision detection, Proceedings of the 2000 IEEE symposium on Volume visualization, p.57-61, October 09-10, 2000, Salt Lake City, Utah, United States
T. R. Reed , H. Wechsler, Segmentation of Textured Images and Gestalt Organization Using Spatial/Spatial-Frequency Representations, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.1, p.1-12, January 1990
Yong K. Hwang , Narendra Ahuja, Gross motion planning—a survey, ACM Computing Surveys (CSUR), v.24 n.3, p.219-291, Sept. 1992
Daniel R. Baum , Stephen Mann , Kevin P. Smith , James M. Winget, Making radiosity usable: automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.51-60, July 1991
Markus M. Breunig , Hans-Peter Kriegel , Raymond T. Ng , Jörg Sander, LOF: identifying density-based local outliers, ACM SIGMOD Record, v.29 n.2, p.93-104, June 2000
Jaroslaw Sugier, Triangulation of NURBS surfaces through adaptive refinement, Machine Graphics & Vision International Journal, v.11 n.1, p.37-52, 2002
Ari Rappoport, The n-dimensional extended convex differences tree (ECDT) for representing polyhedra, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.139-147, June 05-07, 1991, Austin, Texas, United States
F. Cazals , C. Puech, Bucket-like space partitioning data structures with applications to ray-tracing, Proceedings of the thirteenth annual symposium on Computational geometry, p.11-20, June 04-06, 1997, Nice, France
D. J. Sheehy , C. G. Armstrong , D. J. Robinson, Computing the medial surface of a solid from a domain Delaunay triangulation, Proceedings of the third ACM symposium on Solid modeling and applications, p.201-212, May 17-19, 1995, Salt Lake City, Utah, United States
Edgar A. Ramos, Construction of 1-d lower envelopes and applications, Proceedings of the thirteenth annual symposium on Computational geometry, p.57-66, June 04-06, 1997, Nice, France
Franz Aurenhammer, Voronoi diagrams—a survey of a fundamental geometric data structure, ACM Computing Surveys (CSUR), v.23 n.3, p.345-405, Sept. 1991
Herbert Edelsbrunner , Ernst P. Mücke, Three-dimensional alpha shapes, ACM Transactions on Graphics (TOG), v.13 n.1, p.43-72, Jan. 1994
Roberto Tamassia, Data structures, ACM Computing Surveys (CSUR), v.28 n.1, p.23-26, March 1996
Chandrajit L. Bajaj , Insung Ihm, Smoothing polyhedra using implicit algebraic splines, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.79-88, July 1992
Atul Sudhalkar , Levent Gürsöz , Fritz Prinz, Continuous skeletons of discrete objects, Proceedings on the second ACM symposium on Solid modeling and applications, p.85-94, May 19-21, 1993, Montreal, Quebec, Canada
Lining Yang , Roger Crawfis, A panoramic walkthrough system with occlusion culling, Proceedings of the workshop on Virtual environments 2003, p.169-177, May 22-23, 2003, Zurich, Switzerland
Madhav Ponamgi , Dinesh Manocha , Ming C. Lin, Incremental algorithms for collision detection between solid models, Proceedings of the third ACM symposium on Solid modeling and applications, p.293-304, May 17-19, 1995, Salt Lake City, Utah, United States
Sunil Arya , David M. Mount , Nathan S. Netanyahu , Ruth Silverman , Angela Y. Wu, An optimal algorithm for approximate nearest neighbor searching fixed dimensions, Journal of the ACM (JACM), v.45 n.6, p.891-923, Nov. 1998
V. T. Rajan, Optimality of the Delaunay triangulation in Rd, Proceedings of the seventh annual symposium on Computational geometry, p.357-363, June 10-12, 1991, North Conway, New Hampshire, United States
Jigang Liu , Si-Qing Zheng, A simplified optimal algorithm for constructing the convex hull of a simple polygon, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
Michael T. Goodrich, Fixed-dimensional parallel linear programming via relative &egr;-approximations, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.132-141, January 28-30, 1996, Atlanta, Georgia, United States
Jeffrey Scott Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys (CSUR), v.33 n.2, p.209-271, June 2001
Bernard Chazelle , Herbert Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Journal of the ACM (JACM), v.39 n.1, p.1-54, Jan. 1992
Yunhong Zhou , Subhash Suri, Analysis of a bounding box heuristic for object intersection, Journal of the ACM (JACM), v.46 n.6, p.833-857, Nov. 1999
Evanthia Papadopoulou, Critical area computation for missing material defects in VLSI circuits, Proceedings of the 2000 international symposium on Physical design, p.140-146, May 2000, San Diego, California, United States
David L. Maulsby , Ian H. Witten , Kenneth A. Kittlitz, Metamouse: specifying graphical procedures by example, ACM SIGGRAPH Computer Graphics, v.23 n.3, p.127-136, July 1989
V. Srinivasan , G. Varghese , S. Suri , M. Waldvogel, Fast and scalable layer four switching, ACM SIGCOMM Computer Communication Review, v.28 n.4, p.191-202, Oct. 1998
Ricardo Farias , Joseph S. B. Mitchell , Cláudio T. Silva, ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering, Proceedings of the 2000 IEEE symposium on Volume visualization, p.91-99, October 09-10, 2000, Salt Lake City, Utah, United States
Thomas Barkowsky, Bibliography, Mental representation and processing of geographic knowledge: a computational approach, Springer-Verlag New York, Inc., New York, NY, 2002
Leonidas Guibas , John Hershberger , Subhash Suri , Li Zhang, Kinetic connectivity for unit disks, Proceedings of the sixteenth annual symposium on Computational geometry, p.331-340, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Nikos Mamoulis , Dimitris Papadias, Integration of spatial join algorithms for processing multiple inputs, ACM SIGMOD Record, v.28 n.2, p.1-12, June 1999
Gary L. Miller , Shang-Hua Teng , William Thurston , Stephen A. Vavasis, Separators for sphere-packings and nearest neighbor graphs, Journal of the ACM (JACM), v.44 n.1, p.1-29, Jan. 1997
Curtis P. Kolovson , Michael Stonebraker, Segment indexes: dynamic indexing techniques for multi-dimensional interval data, ACM SIGMOD Record, v.20 n.2, p.138-147, June 1991
Ethem Alpaydin, Voting over Multiple Condensed Nearest Neighbors, Artificial Intelligence Review, v.11 n.1-5, p.115-132, Feb. 1997
Joseph S. B. Mitchell , Subhash Suri, Separation and approximation of polyhedral objects, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.296-306, September 1992, Orlando, Florida, United States
B. Aronov, On the geodesic Voronoi diagram of point sites in a simple polygon, Proceedings of the third annual symposium on Computational geometry, p.39-49, June 08-10, 1987, Waterloo, Ontario, Canada
T. Ottmann , G. Theimt , C. Ullrich, Numerical stability of geometric algorithms, Proceedings of the third annual symposium on Computational geometry, p.119-125, June 08-10, 1987, Waterloo, Ontario, Canada
Azzedine Boukerche , Sajal K. Das , Alessandro Fabbri , Oktay Yildiz, Exploiting model independence for parallel PCS network simulation, Proceedings of the thirteenth workshop on Parallel and distributed simulation, p.166-173, May 01-04, 1999, Atlanta, Georgia, United States
Chris Joslin , Nadia Magnenat-Thalmann, Significant facet retrieval for real-time 3D sound rendering in complex virtual environments, Proceedings of the ACM symposium on Virtual reality software and technology, October 01-03, 2003, Osaka, Japan
Hyoseop Shin , Bongki Moon , Sukho Lee, Adaptive multi-stage distance join processing, ACM SIGMOD Record, v.29 n.2, p.343-354, June 2000
Marco Pellegrini, On lines missing polyhedral sets in 3-space, Proceedings of the ninth annual symposium on Computational geometry, p.19-28, May 18-21, 1993, San Diego, California, United States
Subhash Suri , George Varghese, Packet filtering in high speed networks, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.969-970, January 17-19, 1999, Baltimore, Maryland, United States
A. Saalfeld, Joint triangulations and triangulation maps, Proceedings of the third annual symposium on Computational geometry, p.195-204, June 08-10, 1987, Waterloo, Ontario, Canada
Yi-Jen Chiang , Roberto Tamassia, Dynamization of the trapezoid method for planar point location (extended abstract), Proceedings of the seventh annual symposium on Computational geometry, p.61-70, June 10-12, 1991, North Conway, New Hampshire, United States
Wolfgang Maass, Efficient agnostic PAC-learning with simple hypothesis, Proceedings of the seventh annual conference on Computational learning theory, p.67-75, July 12-15, 1994, New Brunswick, New Jersey, United States
N. Adlai A. DePano , Farinaz D. Boudreaux , Philip Katner , Brian Li, Algorthmic pradigms: examples in computational geometry II, ACM SIGCSE Bulletin, v.22 n.1, p.186-191, Feb. 1990
Thomas Brinkhoff , Hans-Peter Kriegel , Bernhard Seeger, Efficient processing of spatial joins using R-trees, ACM SIGMOD Record, v.22 n.2, p.237-246, June 1, 1993
Cláudio T. Silva , Joseph S. B. Mitchell , Peter L. Williams, An exact interactive time visibility ordering algorithm for polyhedral cell complexes, Proceedings of the 1998 IEEE symposium on Volume visualization, p.87-94, October 19-20, 1998, Research Triangle Park, North Carolina, United States
Pankaj K. Agarwal , Boris Aronov , Sariel Har-Peled , Micha Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proceedings of the fifteenth annual symposium on Computational geometry, p.380-389, June 13-16, 1999, Miami Beach, Florida, United States
Jeff Erickson, Space-time tradeoffs for emptiness queries (extended abstract), Proceedings of the thirteenth annual symposium on Computational geometry, p.304-313, June 04-06, 1997, Nice, France
J.-D. Boissonnat , O. Devillers , L. Donati , F. P. Preparata, Stable placements for spider robots, Proceedings of the eighth annual symposium on Computational geometry, p.242-250, June 10-12, 1992, Berlin, Germany
Simon Kahan , Jack Snoeyink, On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time, Proceedings of the twelfth annual symposium on Computational geometry, p.151-158, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Martin Gavrilov , Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian, Geometric pattern matching: a performance study, Proceedings of the fifteenth annual symposium on Computational geometry, p.79-85, June 13-16, 1999, Miami Beach, Florida, United States
Tamal K. Dey , Kurt Mehlhorn , Edgar A. Ramos, Curve reconstruction: connecting dots with good reason, Proceedings of the fifteenth annual symposium on Computational geometry, p.197-206, June 13-16, 1999, Miami Beach, Florida, United States
Jeffrey Scott Vitter, External memory algorithms, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
N. S. V. Rao , E. M. Oblow , C. W. Glover, Learning Separations by Boolean Combinations of Half-Spaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.7, p.765-768, July 1994
Peter Litwinowicz , Gavin Miller, Efficient techniques for interactive texture placement, Proceedings of the 21st annual conference on Computer graphics and interactive techniques, p.119-122, July 1994
M. N. Vrahatis , B. Boutsinas , P. Alevizos , G. Pavlides, The new k-windows algorithm for improving the k-means clustering algorithm, Journal of Complexity, v.18 n.1, p.375-391, March 2002
Oliver Günther, Data management in environmental information systems, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
Po-Hsueh Huang , Yin Te Tsai , Chuan Yi Tang, A fast algorithm for the alpha-connected two-center decision problem, Information Processing Letters, v.85 n.4, p.205-210, 28 February 2003
Man-Fai Yu , Joel Darnauer , Wayne Wei-Ming Dai, Interchangeable pin routing with application to package layout, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.668-673, November 10-14, 1996, San Jose, California, United States
Nickolas S. Sapidis , Renato Perucchio, Domain Delaunay Tetrahedrization of arbitrarily shaped curved polyhedra defined in a solid modeling system, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.465-480, June 05-07, 1991, Austin, Texas, United States
Neelima Gupta , Sandeep Sen, Faster output-sensitive parallel convex hulls for d≤3: optimal sublogarithmic algorithms for small outputs, Proceedings of the twelfth annual symposium on Computational geometry, p.176-185, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Victor Firoiu , Jim Kurose , Don Towsley, Efficient admission control of piecewise linear traffic envelopes at EDF schedulers, IEEE/ACM Transactions on Networking (TON), v.6 n.5, p.558-570, Oct. 1998
Michael T. Goodrich , Roberto Tamassia, Dynamic ray shooting and shortest paths via balanced geodesic triangulations, Proceedings of the ninth annual symposium on Computational geometry, p.318-327, May 18-21, 1993, San Diego, California, United States
K. L. Clarkson , P. W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, Proceedings of the fourth annual symposium on Computational geometry, p.12-17, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Oscar Palacios-Velez, A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems, ACM Transactions on Mathematical Software (TOMS), v.16 n.3, p.275-291, Sept. 1990
E. Welzl, Partition trees for triangle counting and other range searching problems, Proceedings of the fourth annual symposium on Computational geometry, p.23-33, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Kensuke Onishi , Hiroshi Imai, Voronoi diagram in statistical parametric space by Kullback-Leibler divergence, Proceedings of the thirteenth annual symposium on Computational geometry, p.463-465, June 04-06, 1997, Nice, France
Prosenjit Bose , David Bremner , Marc van Kreveld, Determining the castability of simple polyhedra, Proceedings of the tenth annual symposium on Computational geometry, p.123-131, June 06-08, 1994, Stony Brook, New York, United States
P. K. Agarwal, A deterministic algorithm for partitioning arrangements of lines and its application, Proceedings of the fifth annual symposium on Computational geometry, p.11-22, June 05-07, 1989, Saarbruchen, West Germany
G. Barequet , C. A. Duncan , M. T. Goodrich , S. Kumar , M. Pop, Efficient perspective-accurate silhouette computation, Proceedings of the fifteenth annual symposium on Computational geometry, p.417-418, June 13-16, 1999, Miami Beach, Florida, United States
K. M. Just , W. L. Schiele , T. Krüger, Plowing: modifying cells and routing 45:9D - layouts, Proceedings of the 26th ACM/IEEE conference on Design automation, p.702-705, June 25-28, 1989, Las Vegas, Nevada, United States
Giuseppe Liotta , France P. Preparata , Roberto Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, Proceedings of the thirteenth annual symposium on Computational geometry, p.156-165, June 04-06, 1997, Nice, France
William Lenhart , Giuseppe Liotta, The drawability problem for minimum weight triangulations, Theoretical Computer Science, v.270 n.1-2, p.261-286, January
Albert G. Greenberg , R. Srikant , Ward Whitt, Resource sharing for book-ahead and instantaneous-request calls, IEEE/ACM Transactions on Networking (TON), v.7 n.1, p.10-22, Feb. 1999
David M. Mount, Intersection detection and separators for simple polygons, Proceedings of the eighth annual symposium on Computational geometry, p.303-311, June 10-12, 1992, Berlin, Germany
Luiz Velho , Luiz Henrique de Figueiredo , Jonas Gomes, A unified approach for hierarchical adaptive tesselation of surfaces, ACM Transactions on Graphics (TOG), v.18 n.4, p.329-360, Oct. 1999
Han-Wei Shen , Charles D. Hansen , Yarden Livnat , Christopher R. Johnson, Isosurfacing in span space with utmost efficiency (ISSUE), Proceedings of the 7th conference on Visualization '96, p.287-ff., October 28-29, 1996, San Francisco, California, United States
Franco P. Preparata , Jeffrey S. Vitter , Mariette Yvinec, Computation of the axial view of a set of isothetic parallelepipeds, ACM Transactions on Graphics (TOG), v.9 n.3, p.278-300, July 1990
Marc de Berg , Leonidas J. Guibas , Dan Halperin, Vertical decompositions for triangles in 3-space, Proceedings of the tenth annual symposium on Computational geometry, p.1-10, June 06-08, 1994, Stony Brook, New York, United States
Marc Vigo , Núria Pla , Josep Cotrina, Regular triangulations of dynamic sets of points, Computer Aided Geometric Design, v.19 n.2, p.127-149, February 2002
Frank Dehne , Andreas Fabri , Andrew Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, Proceedings of the ninth annual symposium on Computational geometry, p.298-307, May 18-21, 1993, San Diego, California, United States
Robert-Paul Berretty , Mark H. Overmars , A. Frank van der Stappen, Orienting polyhedral parts by pushing, Computational Geometry: Theory and Applications, v.21 n.1, p.21-38, January 2002
Jürgen Garloff , Birgit Graf, Robust Schur Stability of Polynomials with Polynomial ParameterDependency, Multidimensional Systems and Signal Processing, v.10 n.2, p.189-199, April 1999
Jie Wu, A distributed formation of smallest faulty orthogonal convex polygons in 2-D meshes, Journal of Parallel and Distributed Computing, v.62 n.7, p.1168-1185, July 2002
Sergei Bespamyatnikh, Packing two disks in a polygon, Computational Geometry: Theory and Applications, v.23 n.1, p.31-42, July 2002
Christian Worm Mortensen, Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
Abbas Edalat , André Lieutier, Foundation of a computable solid modelling, Theoretical Computer Science, v.284 n.2, p.319-345, 28 July 2002
Ralf Hartmut Güting, An introduction to spatial database systems, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.4, October 1994
P. J. Wan , G. Călinescu , X. Y. Li , O. Frieder, Minimum-energy broadcasting in static ad hoc wireless networks, Wireless Networks, v.8 n.6, p.607-617, November 2002
Jin J. Chou, Voronoi Diagrams for Planar Shapes, IEEE Computer Graphics and Applications, v.15 n.2, p.52-59, March 1995
Miguel Felder , Angelo Morzenti, Validating real-time systems by history-checking TRIO specifications, ACM Transactions on Software Engineering and Methodology (TOSEM), v.3 n.4, p.308-339, Oct. 1994
Andrew Kahng , Jason Cong , Gabriel Robins, High-performance clock routing based on recursive geometric matching, Proceedings of the 28th conference on ACM/IEEE design automation, p.322-327, June 17-22, 1991, San Francisco, California, United States
D. Avis , R. Wenger, Algorithms for line transversals in space, Proceedings of the third annual symposium on Computational geometry, p.300-307, June 08-10, 1987, Waterloo, Ontario, Canada
Masato Edahiro, A clustering-based optimization algorithm in zero-skew routings, Proceedings of the 30th international conference on Design automation, p.612-616, June 14-18, 1993, Dallas, Texas, United States
Mordecai J. Golin, Maxima in convex regions, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.352-360, January 25-27, 1993, Austin, Texas, United States
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz, Constraint query languages (preliminary report), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.299-313, April 02-04, 1990, Nashville, Tennessee, United States
Henry Moreton, Watertight tessellation using forward differencing, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware, p.25-32, August 2001, Los Angeles, California, United States
Azzedine Boukerche , Sajal K. Das , Alessandro Fabbri, SWiMNet: a scalable parallel simulation testbed for wireless and mobile networks, Wireless Networks, v.7 n.5, p.467-486, September 2001
Suresh Chari , Pankaj Rohatgi , Aravind Srinivasan, Improved algorithms via approximations of probability distributions (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.584-592, May 23-25, 1994, Montreal, Quebec, Canada
Christian A. Duncan , Michael T. Goodrich , Edgar A. Ramos, Efficient approximation and optimization algorithms for computational metrology, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.121-130, January 05-07, 1997, New Orleans, Louisiana, United States
David Kirkpatrick , Jack Snoeyink, Tentative prune-and-search for computing Voronoi vertices, Proceedings of the ninth annual symposium on Computational geometry, p.133-142, May 18-21, 1993, San Diego, California, United States
Alain Fournier , Donald Fussell, On the power of the frame buffer, ACM Transactions on Graphics (TOG), v.7 n.2, p.103-128, April 1988
John Hershberger, Optimal parallel algorithms for triangulated simple polygons, Proceedings of the eighth annual symposium on Computational geometry, p.33-42, June 10-12, 1992, Berlin, Germany
Wolf-Fritz Riekert, Extracting Area Objects from Raster Image Data, IEEE Computer Graphics and Applications, v.13 n.2, p.68-73, March 1993
Prosenjit Gupta , Ravi Janardan , Michiel Smid , Bhaskar Dasgupta, The rectangle enclosure and point-dominance problems revisited, Proceedings of the eleventh annual symposium on Computational geometry, p.162-171, June 05-07, 1995, Vancouver, British Columbia, Canada
Barry F. Schaudt , R. L. Scot Drysdale, Multiplicatively weighted crystal growth Voronoi diagrams (extended abstract), Proceedings of the seventh annual symposium on Computational geometry, p.214-223, June 10-12, 1991, North Conway, New Hampshire, United States
Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
Stephen Cameron , Chee-Keng Yap, Refinement methods for geometric bounds in constructive solid geometry, ACM Transactions on Graphics (TOG), v.11 n.1, p.12-39, Jan. 1992
Jyun-Ming Chen , E. Levent Gürsöz , Friedrich B. Prinz, Integration of parametric geometry and non-manifold topology in geometric modeling, Proceedings on the second ACM symposium on Solid modeling and applications, p.53-64, May 19-21, 1993, Montreal, Quebec, Canada
D. G. Kirkpatrick, Establishing order in planar subdivisions, Proceedings of the third annual symposium on Computational geometry, p.316-321, June 08-10, 1987, Waterloo, Ontario, Canada
Marco Pellegrini, On point location and motion planning among simplices, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.95-104, May 23-25, 1994, Montreal, Quebec, Canada
Sunil Arya , David M. Mount, Approximate nearest neighbor queries in fixed dimensions, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.271-280, January 25-27, 1993, Austin, Texas, United States
J. Royle , M. Palczewski , H. VerHeyen , N. Naccache , J. Soukup, Geometrical compaction in one dimension for channel routing, Proceedings of the 24th ACM/IEEE conference on Design automation, p.140-145, June 28-July 01, 1987, Miami Beach, Florida, United States
Marek Chrobak , Michael T. Goodrich , Roberto Tamassia, Convex drawings of graphs in two and three dimensions (preliminary version), Proceedings of the twelfth annual symposium on Computational geometry, p.319-328, May 24-26, 1996, Philadelphia, Pennsylvania, United States
Ying-Meng Li , Marwan A. Jabri, A zero-skew clock routing scheme for VLSI circuits, Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, p.458-463, November 1992, Santa Clara, California, United States
In-Soo Kang , Tae-wan Kim , Ki-Joune Li, A spatial data mining method by Delaunay triangulation, Proceedings of the 5th ACM international workshop on Advances in geographic information systems, p.35-39, November 10-14, 1997, Las Vegas, Nevada, United States
M. Bern, Hidden surface removal for rectangles, Proceedings of the fourth annual symposium on Computational geometry, p.183-192, June 06-08, 1988, Urbana-Champaign, Illinois, United States
J. I. Munro , M. H. Overmars , D. Wood, Variations on visibility, Proceedings of the third annual symposium on Computational geometry, p.291-299, June 08-10, 1987, Waterloo, Ontario, Canada
Michael Murphy , David M. Mount , Carl W. Gable, A point-placement strategy for conforming Delaunay tetrahedralization, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.67-74, January 09-11, 2000, San Francisco, California, United States
Christos Levcopoulos , Drago Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.392-401, January 28-30, 1996, Atlanta, Georgia, United States
Daniel P. Huttenlocher , Klara Kedem , Micha Sharir, The upper envelope of Voronoi surfaces and its applications, Proceedings of the seventh annual symposium on Computational geometry, p.194-203, June 10-12, 1991, North Conway, New Hampshire, United States
Eric Monfroy , Michaël Rusinowitch , René Schott, Implementing non-linear constraints with cooperative solvers, Proceedings of the 1996 ACM symposium on Applied Computing, p.63-72, February 17-19, 1996, Philadelphia, Pennsylvania, United States
Srinivas Doddi , Madhav V. Marathe , Andy Mirzaian , Bernard M. E. Moret , Binhai Zhu, Map labeling and its generalizations, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.148-157, January 05-07, 1997, New Orleans, Louisiana, United States
Hla Min , S. Q. Zheng, Time-space optimal convex Hull algorithms, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.687-693, February 14-16, 1993, Indianapolis, Indiana, United States
D. T. Lee, Computational geometry, ACM Computing Surveys (CSUR), v.28 n.1, p.27-31, March 1996
Steven S. Skiena, Computational geometry, Computer graphics companion, Macmillan Press Ltd., Basingstoke, UK, 2002
Amir H. Farrahi , Majid Sarrafzadeh, System partitioning to maximize sleep time, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.452-455, November 05-09, 1995, San Jose, California, United States
Jonathan C. Hardwick, Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.239-248, June 23-25, 1997, Newport, Rhode Island, United States
Lusine Yepremyan , James E. Falk, Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems, Computers and Operations Research, v.32 n.4, p.793-812, April 2005
David Eppstein, Faster construction of planar two-centers, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.131-138, January 05-07, 1997, New Orleans, Louisiana, United States
David Meyers , Shelley Skinner , Kenneth Sloan, Surfaces from contours, ACM Transactions on Graphics (TOG), v.11 n.3, p.228-258, July 1992
L. Boxer , R. Miller, Dynamic computational geometry on parallel computers, Proceedings of the third conference on Hypercube concurrent computers and applications, p.1212-1219, January 1989, Pasadena, California, United States
Yi-Jen Chiang , Cláudio T. Silva, I/O optimal isosurface extraction (extended abstract), Proceedings of the 8th conference on Visualization '97, p.293-ff., October 18-24, 1997, Phoenix, Arizona, United States
Sujit T. Zachariah , Sreejit Chakravarty , Carl D. Roth, A novel algorithm to extract two-node bridges, Proceedings of the 37th conference on Design automation, p.790-793, June 05-09, 2000, Los Angeles, California, United States
C. Bradford Barber , David P. Dobkin , Hannu Huhdanpaa, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software (TOMS), v.22 n.4, p.469-483, Dec. 1996
M. Goodrich , M. Ghouse , J. Bright, Generalized sweep methods for parallel computational geometry, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.280-289, July 02-06, 1990, Island of Crete, Greece
Manoranjan Dash , Huan Liu , Peter Scheuermann , Kian Lee Tan, Fast hierarchical clustering and its validation, Data & Knowledge Engineering, v.44 n.1, p.109-138, January 2003
Antoine Vigneron, Reporting intersections among thick objects, Information Processing Letters, v.85 n.2, p.87-92, 31 January 2003
Fabian Schwarzer , Itay Lotan, Approximation of protein structure for fast similarity measures, Proceedings of the seventh annual international conference on Research in computational molecular biology, p.267-276, April 10-14, 2003, Berlin, Germany
B. Buchberger, Algebraic methods for non-linear computational geometry (invited address), Proceedings of the fourth annual symposium on Computational geometry, p.81-82, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Jeffrey A. Bloom , Chang Y. Choo , William I. Kwak, Model-based recognition of arbitrary surfaces from range data, Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems, p.184-190, June 1990, Charleston, South Carolina, United States
Chung Keung Poon , Binhai Zhu , Franis Chin, A polynomial time solution for labeling a rectilinear map, Proceedings of the thirteenth annual symposium on Computational geometry, p.451-453, June 04-06, 1997, Nice, France
Hanan Samet, Hierarchical representations of collections of small rectangles, ACM Computing Surveys (CSUR), v.20 n.4, p.271-309, Dec. 1988
Wael M. Badawy , Walid G. Aref, On local heuristics to speed up polygon-polygon intersection tests, Proceedings of the 7th ACM international symposium on Advances in geographic information systems, p.97-102, November 02-06, 1999, Kansas City, Missouri, United States
Herbert Edelsbrunner , Nimish R. Shah, Triangulating topological spaces, Proceedings of the tenth annual symposium on Computational geometry, p.285-292, June 06-08, 1994, Stony Brook, New York, United States
Peter Epstein , Jörg-Rüdiger Sack, Generating triangulations at random, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.3, p.267-278, July 1994
R. D. Lou , M. Sarrafzadeh , D. T. Lee, An optimal algorithm for the maximum two-chain problem, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.149-158, January 22-24, 1990, San Francisco, California, United States
Michael T. Goodrich , Joseph S. B. Mitchell , Mark W. Orletsky, Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version), Proceedings of the tenth annual symposium on Computational geometry, p.103-112, June 06-08, 1994, Stony Brook, New York, United States
Duoduo Liao , Shiaofen Fang, Fast volumetric CSG modeling using standard graphics system, Proceedings of the seventh ACM symposium on Solid modeling and applications, June 17-21, 2002, Saarbrücken, Germany
Pankaj K. Agarwal , Cecilia M. Procopiuc, Approximation algorithms for projective clustering, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.538-547, January 09-11, 2000, San Francisco, California, United States
Mikhail J. Atallah , Michael T. Goodrich , Kumar Ramaiyer, Biased finger trees and three-dimensional layers of maxima: (preliminary version), Proceedings of the tenth annual symposium on Computational geometry, p.150-159, June 06-08, 1994, Stony Brook, New York, United States
Michael T. Goodrich, Efficient piecewise-linear function approximation using the uniform metric: (preliminary version), Proceedings of the tenth annual symposium on Computational geometry, p.322-331, June 06-08, 1994, Stony Brook, New York, United States
Ivan L. Wemple , Andrew T. Yang, Mixed-signal switching noise analysis using Voronoi-tessellated substrate macromodels, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.439-444, June 12-16, 1995, San Francisco, California, United States
Prosenjit Bose , Anil Maheshwari , Pat Morin, Fast approximations for sums of distances, clustering and the Fermat--Weber problem, Computational Geometry: Theory and Applications, v.24 n.3, p.135-146, April 2003
Paul B. Callahan , S. Rao Kosaraju, A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.546-556, May 04-06, 1992, Victoria, British Columbia, Canada
K. L. Clarkson , R. E. Tarjan , C. J. Van Wyk, A fast Las Vegas algorithm for triangulating a simple polygon, Proceedings of the fourth annual symposium on Computational geometry, p.18-22, June 06-08, 1988, Urbana-Champaign, Illinois, United States
James R. Kent , Wayne E. Carlson , Richard E. Parent, Shape transformation for polyhedral objects, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.47-54, July 1992
Ziv Gigus , John Canny , Raimund Seidel, Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.6, p.542-551, June 1991
Pankaj K. Agarwal , Pavan K. Desikan, Approximation algorithms for layered manufacturing, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.528-537, January 09-11, 2000, San Francisco, California, United States
Hyoseop Shin , Bongki Moon , Sukho Lee, Tie-breaking strategies for fast distance join processing, Data & Knowledge Engineering, v.41 n.1, p.67-83, April 2002
Danny Z. Chen , Mikhail J. Atallah, Optimal Parallel Hypercube Algorithms for Polygon Problems, IEEE Transactions on Computers, v.44 n.7, p.914-922, July 1995
Sandeep Sen , Neelima Gupta, Distribution-sensitive algorithms, Nordic Journal of Computing, v.6 n.2, p.194-211, Summer 1999
Harry Shum , Katsushi Ikeuchi , Raj Reddy, Principal component analysis with missing data and its application to polyhedral object modeling, Modelling from reality, Kluwer Academic Publishers, Norwell, MA, 2001
Drago Krznaric , Christos Levcopoulos, Optimal algorithms for complete linkage clustering in d dimensions, Theoretical Computer Science, v.286 n.1, p.139-149, 6 September 2002
Seth Teller , Matthew Antone , Zachary Bodnar , Michael Bosse , Satyan Coorg , Manish Jethwa , Neel Master, Calibrated, Registered Images of an Extended Urban Area, International Journal of Computer Vision, v.53 n.1, p.93-107, June 2003
William E. Lorensen , Boris Yamrom, Golf Green Visualization, IEEE Computer Graphics and Applications, v.12 n.4, p.35-41, 44, July 1992
Dimitris Papadias , Yufei Tao , Greg Fu , Bernhard Seeger, An optimal and progressive algorithm for skyline queries, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
A. Laurentini, The Visual Hull Concept for Silhouette-Based Image Understanding, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.2, p.150-162, February 1994
Gill Barequet , Matthew T. Dickerson , Robert L. Scot Drysdale, 2-Point site Voronoi diagrams, Discrete Applied Mathematics, v.122 n.1-3, p.37-54, 15 October 2002
Tsung-Pao Fang , Les A. Piegl, Delaunay Triangulation in Three Dimensions, IEEE Computer Graphics and Applications, v.15 n.5, p.62-69, September 1995
Daniele V. Finocchiaro , Marco Pellegrini, On computing the diameter of a point set in high dimensional Euclidean space, Theoretical Computer Science, v.287 n.2, p.501-514, 28 September 2002
Damian J. Sheehy , Cecil G. Armstrong , Desmond J. Robinson, Shape Description By Medial Surface Construction, IEEE Transactions on Visualization and Computer Graphics, v.2 n.1, p.62-72, March 1996
Hyeon-Suk Na , Chung-Nim Lee , Otfried Cheong, Voronoi diagrams on the sphere, Computational Geometry: Theory and Applications, v.23 n.2, p.183-194, September 2002
Ramakrishna Thurimella , Mario Alberto Lopez, On Computing Connected Components of Line Segments, IEEE Transactions on Computers, v.44 n.4, p.597-601, April 1995
David Hutchinson , Anil Maheshwari , Norbert Zeh, An external memory data structure for shortest path queries, Discrete Applied Mathematics, v.126 n.1, p.55-82, March 2003
Oliver Kreylos , Bernd Hamann, On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data, IEEE Transactions on Visualization and Computer Graphics, v.7 n.1, p.17-31, January 2001
Binary Bhattacharya , Robert Benkoczi, On computing the optimal bridge between two convex polygons, Information Processing Letters, v.79 n.5, p.215-221, September 15, 2001
Hongjun Zhu , Jianwen Su , Oscar H. Ibarra, Trajectory queries and octagons in moving object databases, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
Sang-Wook Kim , Sanghyun Park , Wesley W. Chu, Efficient processing of similarity search under time warping in sequence databases: an index-based approach, Information Systems, v.29 n.5, p.405-420, July 2004
D. T. Lee , C. D. Yang , C. K. Wong, On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model, IEEE Transactions on Computers, v.43 n.6, p.711-724, June 1994
Shan-Chyun Ku , Biing-Feng Wang, An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs, Journal of Parallel and Distributed Computing, v.62 n.2, p.221-227, February 2002
Leon Shirman , Yakov Kamen, Fast and Accurate Texture Placement, IEEE Computer Graphics and Applications, v.17 n.1, p.60-66, January 1997
Sven Schuierer, An O(log log n) time algorithm to compute the kernel of a polygon, Nordic Journal of Computing, v.1 n.4, p.458-474, Winter 1994
A. Pikaz , I. Disntein, Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.8, p.808-813, August 1994
Pin-Kwang Eng , Beng Chin Ooi , Kian-Lee Tan, Indexing for progressive skyline computation, Data & Knowledge Engineering, v.46 n.2, p.169-201, August 2003
Minghui Jiang , Jianbo Qian , Zhongping Qin , Binhai Zhu , Robert Cimikowski, A simple factor-3 approximation for labeling points with circles, Information Processing Letters, v.87 n.2, p.101-105, 31 July 2003
Lilian Buzer, A linear incremental algorithm for naive and standard digital lines and planes recognition, Graphical Models, v.65 n.1-3, p.61-76, January 2003
Carl Frederick , Eric L. Schwartz, Vision: Conformal Image Warping, IEEE Computer Graphics and Applications, v.10 n.2, p.54-61, March 1990
Giri Narasimhan , Michiel Smid, Approximation algorithms for the bottleneck stretch factor problem, Nordic Journal of Computing, v.9 n.1, p.13-31, Spring 2002
Drago Krznaric , Christos Levcopoulos , Bengt J. Nilsson, Minimum spanning trees in d dimensions, Nordic Journal of Computing, v.6 n.4, p.446-461, Winter 1999
Olivier Devillers , Asish Mukhopadhyay, Finding an ordinary conic and an ordinary hyperplane, Nordic Journal of Computing, v.6 n.4, p.462-468, Winter 1999
Yung H. Tsin , Cao-An Wang, Geodesic Voronoi diagrams in the presence of rectilinear barriers, Nordic Journal of Computing, v.3 n.1, p.1-26, Spring 1996
Qin Zhao , Bart Mesman , Twan Basten, Static resource models for code-size efficient embedded processors, ACM Transactions on Embedded Computing Systems (TECS), v.2 n.2, p.219-250, May 2003
Ali Shokoufandeh , Sven Dickinson, Graph-theoretical methods in computer vision, Theoretical aspects of computer science: advanced lectures, Springer-Verlag New York, Inc., New York, NY, 2002
Florin Balasa , Sarat C. Maruvada , Karthik Krishnamoorthy, Efficient solution space exploration based on segment trees in analog placement with symmetry constraints, Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, p.497-502, November 10-14, 2002, San Jose, California
Amitava Datta , Anil Maheshwari , Jörg-Rüdiger Sack, Optimal parallel algorithms for direct dominance problems, Nordic Journal of Computing, v.3 n.1, p.72-88, Spring 1996
Joachim Gudmundsson , Christos Levcopoulos, A fast approximation algorithm for TSP with neighborhoods, Nordic Journal of Computing, v.6 n.4, p.469-488, Winter 1999
Donghui Zhang , Dimitrios Gunopulos , Vassilis J. Tsotras , Bernhard Seeger, Temporal and spatio-temporal aggregations over data streams using multiple time granularities, Information Systems, v.28 n.1-2, p.61-84, 01 March 2003
Jerome L. Lewis, A reliable test for inclusion of a point in a polygon, ACM SIGCSE Bulletin, v.34 n.4, December 2002
Pankaj K. Agarwal , Cecilia M. Procopiuc , Kasturi R. Varadarajan, A (1 + ɛ)-approximation algorithm for 2-line-center, Computational Geometry: Theory and Applications, v.26 n.2, p.119-128, October 2003
Alejandro López-Ortiz , Sven Schuierer, Searching and on-line recognition of star-shaped polygons, Information and Computation, v.185 n.1, p.66-88, August 25, 2003
Eric Steinhart, Supermachines and Superminds, Minds and Machines, v.13 n.1, p.155-186, February 2003
Rob Duncan , Jianbo Qian , Antoine Vigneron , Binhai Zhu, Polynomial time algorithms for three-label point labeling, Theoretical Computer Science, v.296 n.1, p.75-87, 4 March 2003
Prosenjit Bose , Anna Lubiw , J. Ian Munro, Efficient visibility queries in simple polygons, Computational Geometry: Theory and Applications, v.23 n.3, p.313-335, November 2002
Charu C. Aggarwal , Dakshi Agrawal, On nearest neighbor indexing of nonlinear trajectories, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.252-259, June 09-11, 2003, San Diego, California
Joseph M. Shapiro , Gary B. Lamont , Gilbert L. Peterson, An evolutionary algorithm to generate ellipsoid network intrusion detectors, Proceedings of the 2005 workshops on Genetic and evolutionary computation, June 25-26, 2005, Washington, D.C.
Michael S. Floater, One-to-one piecewise linear mappings over triangulations, Mathematics of Computation, v.72 n.242, p.685-696, 1 April 2003
Nick Koudas , Kenneth C. Sevcik, High Dimensional Similarity Joins: Algorithms and Performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.3-18, January 2000
Wei-Mei Chen , Hsien-Kuei Hwang, Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model, Journal of Algorithms, v.46 n.2, p.140-177, February 2003
Pedro V. Sander , Denis Peleshchuk , Barbara J. Grosz, A scalable, distributed algorithm for efficient task allocation, Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3, July 15-19, 2002, Bologna, Italy
Prosenjit Bose, On embedding an outer-planar graph in a point set, Computational Geometry: Theory and Applications, v.23 n.3, p.303-312, November 2002
Frederick R. Reiss , Tapas Kanungo, A characterization of the sensitivity of query optimization to storage access cost parameters, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
Amitabh Varshney , Frederick P. Brooks, Fast analytical computation of Richards's smooth molecular surface, Proceedings of the 4th conference on Visualization '93, October 25-29, 1993, San Jose, California
Kumar Vadaparty , Shamim Naqvi, Using Constraints for Efficient Query Processing in Nondeterministic Databases, IEEE Transactions on Knowledge and Data Engineering, v.7 n.6, p.850-864, December 1995
Xiaolin Wu , Yonggang Fang, An efficient range search algorithm for visualizing extrema of volume data, Proceedings of the 3rd conference on Visualization '92, October 19-23, 1992, Boston, Massachusetts
Heung-Yeung Shum , Katsushi Ikeuchi , Raj Reddy, Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.9, p.854-867, September 1995
Asish Mukhopadhyay, Using simplicial partitions to determine a closest point to a query line, Pattern Recognition Letters, v.24 n.12, p.1915-1920, August 2003
Yu Wang , Xiang-Yang Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, Proceedings of the 2003 joint workshop on Foundations of mobile computing, p.59-68, September 19, 2003, San Diego, CA, USA
Armin Iske, Progressive scattered data filtering, Journal of Computational and Applied Mathematics, v.158 n.2, p.297-316, 15 September 2003
James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia, Algorithm animation over the World Wide Web, Proceedings of the workshop on Advanced visual interfaces, May 27-29, 1996, Gubbio, Italy
Prabir Bhattacharya , Azriel Rosenfeld, Convexity properties of space curves, Pattern Recognition Letters, v.24 n.15, p.2509-2517, November 2003
Eric L. Schwartz , Bjorn Merker , Estarose Wolfson , Alan Shaw, Applications of Computer Graphics and Image Processing to 2D and 3D Modeling of the Functional Architecture of Visual Cortex, IEEE Computer Graphics and Applications, v.8 n.4, p.13-23, July 1988
Michael J. Laszlo, Techniques for visualizing 3-dimensional manifolds, Proceedings of the 1st conference on Visualization '90, October 23-26, 1990, San Francisco, California
Tamara Munzner , François Guimbretière , Serdar Tasiran , Li Zhang , Yunhong Zhou, TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility, ACM Transactions on Graphics (TOG), v.22 n.3, July 2003
Fangju Wang, A Parallel Intersection Algorithm for Vector Polygon Overlay, IEEE Computer Graphics and Applications, v.13 n.2, p.74-81, March 1993
Paolo Cignoni , Claudio Montani , Enrico Puppo , Roberto Scopigno, Multiresolution Representation and Visualization of Volume Data, IEEE Transactions on Visualization and Computer Graphics, v.3 n.4, p.352-369, October 1997
Ignacio Castaño, Filling texture holes using the euclidean distance map, Graphics programming methods, Charles River Media, Inc., Rockland, MA, 2003
Sujit Thomas Zachariah , Sreejit Chakravarty, Algorithm to extract two-node bridges, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.11 n.4, p.741-744, August 2003
Martin D. Levine , Ajit Rajwade, Three-dimensional view-invariant face recognition using a hierarchical pose-normalization strategy, Machine Vision and Applications, v.17 n.5, p.309-325, September 2006
Jesper Jansson , Andrzej Lingas, A fast algorithm for optimal alignment between similar ordered trees, Fundamenta Informaticae, v.56 n.1,2, p.105-120, July 2003
Danny Z. Chen , Ovidiu Daescu , Xiaobo Hu , Jinhui Xu, Finding an optimal path without growing the tree, Journal of Algorithms, v.49 n.1, p.13-41, 1 October 2003
Edwin H. Jacox , Hanan Samet, Iterative spatial join, ACM Transactions on Database Systems (TODS), v.28 n.3, p.230-256, September 2003
Kelly A. Lyons, Cluster busting in anchored graph drawing, Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research, November 09-12, 1992, Toronto, Ontario, Canada
Hervé Brönnimann , Timothy M. Chan , Eric Y. Chen, Towards in-place geometric algorithms and data structures, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
William E. Lorensen , Boris Yamrom, Golf green visualization, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California
N. S. V. Rao, Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems, IEEE Transactions on Computers, v.42 n.4, p.447-457, April 1993
Hee-Kap Ahn , Siu-Wing Cheng , Otfried Cheong , Mordecai Golin , René van Oostrum, Competitive facility location: the Voronoi game, Theoretical Computer Science, v.310 n.1-3, p.457-467, 01 January 2004
Michael Segal, Placing an abnoxious facility in geometric networks, Nordic Journal of Computing, v.10 n.3, p.224-237, September 2003
Sasanka Roy , Partha P. Goswami , Sandip Das , Subhas C. Nandy, Optimal algorithm for a special point-labeling problem, Information Processing Letters, v.89 n.2, p.91-98, 31 January 2004
John M. Boyer, Bulletproof business process automation: securing XML forms with document subset signatures, Proceedings of the 2003 ACM workshop on XML security, October 31-31, 2003, Fairfax, Virginia
Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert, Complete, exact, and efficient computations with cubic curves, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
Danny Z. Chen, Efficient Geometric Algorithms on the EREW PRAM, IEEE Transactions on Parallel and Distributed Systems, v.6 n.1, p.41-47, January 1995
Michael Werman , Z. Geyzel, Fitting a Second Degree Curve in the Presence of Error, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.2, p.207-211, February 1995
Lori Scarlatos , The Pavlidis, Hierarchical triangulation using terrain features, Proceedings of the 1st conference on Visualization '90, October 23-26, 1990, San Francisco, California
Madhav K. Ponamgi , Dinesh Manocha , Ming C. Lin, Incremental Algorithms for Collision Detection Between Polygonal Models, IEEE Transactions on Visualization and Computer Graphics, v.3 n.1, p.51-64, January 1997
M. C. Chen , L. P. McNamee, On the Data Model and Access Method of Summary Data Management, IEEE Transactions on Knowledge and Data Engineering, v.1 n.4, p.519-529, December 1989
Tamal K. Dey , Chanderjit L. Bajaj , Kokicki Sugihara, On good triangulations in three dimensions, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.431-441, June 05-07, 1991, Austin, Texas, United States
A. Aggarwal , L. Guibas , J. Saxe , P. Shor, A Linear time algorithm for computing the Voronoi diagram of a convex polygon, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.39-45, January 1987, New York, New York, United States
Timothy M. Y. Chan , Jack Snoeyink , Chee-Keng Yap, Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.282-291, January 22-24, 1995, San Francisco, California, United States
T. Asano , B. Bhattacharya , M. Keil , F. Yao, Clustering algorithms based on minimum and maximum spanning trees, Proceedings of the fourth annual symposium on Computational geometry, p.252-257, June 06-08, 1988, Urbana-Champaign, Illinois, United States
James A. Storer , John H. Reif, Shortest paths in the plane with polygonal obstacles, Journal of the ACM (JACM), v.41 n.5, p.982-1012, Sept. 1994
Andrew Lippman , William Butera, Coding image sequences for interactive retrieval, Communications of the ACM, v.32 n.7, p.852-860, July 1989
Herbert Edelsbrunner , Ernst P. Mücke, Three-dimensional alpha shapes, Proceedings of the 1992 workshop on Volume visualization, p.75-82, October 19-20, 1992, Boston, Massachusetts, United States
Fu Chang , Ya-Ching Lu , Theo Pavlidis, Feature Analysis Using Line Sweep Thinning Algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.21 n.2, p.145-158, February 1999
Owen Astrachan, Pictures as invariants, ACM SIGCSE Bulletin, v.23 n.1, p.112-118, Mar. 1991
Jean-Daniel Boissonnat , Olivier Devillers , Monique Teillaud , Mariette Yvinec, Triangulations in CGAL (extended abstract), Proceedings of the sixteenth annual symposium on Computational geometry, p.11-18, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Michael T. Goodrich, Randomized fully-scalable BSP techniques for multi-searching and convex hull construction, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.767-776, January 05-07, 1997, New Orleans, Louisiana, United States
A. Crauser , P. Ferragina , K. Mehlhorn , U. Meyer , E. Ramos, Randomized external-memory algorithms for some geometric problems, Proceedings of the fourteenth annual symposium on Computational geometry, p.259-268, June 07-10, 1998, Minneapolis, Minnesota, United States
Dimitris Papadias , Nikos Mamoulis , Yannis Theodoridis, Processing and optimization of multiway spatial joins using R-trees, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.44-55, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
W. L. Schiele , Th. Krüger , K. M. Just , F. H. Kirsch, A gridless router for industrial design rules, Proceedings of the 27th ACM/IEEE conference on Design automation, p.626-631, June 24-27, 1990, Orlando, Florida, United States
M. J. Atallah , J. J. Tsay, On the parallel decomposability of geometric problems, Proceedings of the fifth annual symposium on Computational geometry, p.104-113, June 05-07, 1989, Saarbruchen, West Germany
Sanjeev Saxena , P. C. Bhatt , V. C. Prasad, Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions, IEEE Transactions on Computers, v.39 n.3, p.400-404, March 1990
Tiziana Calamoneri , Stephan Olariu , Rossella Petreschi, A Simple Parallel Algorithm to Draw Cubic Graphs, IEEE Transactions on Parallel and Distributed Systems, v.11 n.10, p.1009-1018, October 2000
T.-C. Wang , D. F. Wong, A graph theoretic technique to speed up floorplan area optimization, Proceedings of the 29th ACM/IEEE conference on Design automation, p.62-68, June 08-12, 1992, Anaheim, California, United States
H Edelsbrunner , L J Guibas, Topologically sweeping an arrangement, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.389-403, May 28-30, 1986, Berkeley, California, United States
Floris Geerts , Bart Kuijpers, Linear approximation of planar spatial databases using transitive-closure logic, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.126-135, May 15-18, 2000, Dallas, Texas, United States
S. Olariu , J. L. Schwing , J. Zhang, Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals, IEEE Transactions on Parallel and Distributed Systems, v.3 n.3, p.364-374, May 1992
R. Miller , Q. F. Stout, Computational geometry on hypercube computers, Proceedings of the third conference on Hypercube concurrent computers and applications, p.1220-1229, January 1989, Pasadena, California, United States
Tomás Feder , Daniel Greene, Optimal algorithms for approximate clustering, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.434-444, May 02-04, 1988, Chicago, Illinois, United States
Marshall Bern , David Dobkin , David Eppstein , Robert Grossman, Visibility with a moving point of view, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.107-117, January 22-24, 1990, San Francisco, California, United States
Peter Litwinowicz, Processing images and video for an impressionist effect, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, p.407-414, August 1997
Steven Salzberg , Arthur L. Delcher , David Heath , Simon Kasif, Best-Case Results for Nearest-Neighbor Learning, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.6, p.599-608, June 1995
H. Edelsbrunner , L. J. Guibas , J. Hershberger , R. Seidel , M. Sharir, Implicitly representing arrangements of lines or segments, Proceedings of the fourth annual symposium on Computational geometry, p.56-69, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Thomas Brinkhoff , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, Multi-step processing of spatial joins, ACM SIGMOD Record, v.23 n.2, p.197-208, June 1994
Prosenjit Bose , Suneeta Ramaswami , Godfried Toussaint , Alain Turki, Experimental results on quadrangulations of sets of fixed points, Computer Aided Geometric Design, v.19 n.7, p.533-552, July 2002
David Dobkin , Subhash Suri, Maintenance of geometric extrema ∈ , Journal of the ACM (JACM), v.38 n.2, p.275-298, April 1991
Nikos Mamoulis , Dimitris Papadias, Multiway spatial joins, ACM Transactions on Database Systems (TODS), v.26 n.4, p.424-475, December 2001
D. P. Huttenlocher , G. A. Klanderman , W. A. Rucklidge, Comparing Images Using the Hausdorff Distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.9, p.850-863, September 1993
Leonidas Guibas , John Hershberger , Jack Snoeyink, Compact interval trees: a data structure for convex hulls, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.169-178, January 22-24, 1990, San Francisco, California, United States
O. Günther , J. Bilmes, Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, v.3 n.3, p.342-356, September 1991
Dan E. Willard, Multidimensional search trees that provide new types of memory reductions, Journal of the ACM (JACM), v.34 n.4, p.846-858, Oct. 1987
Philippe Flajolet , Gaston Gonnet , Claude Puech , J. M. Robson, The analysis of multidimensional searching in quad-trees, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.100-109, January 28-30, 1991, San Francisco, California, United States
Rolf Klein , Andrzej Lingas, A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon, Proceedings of the ninth annual symposium on Computational geometry, p.124-132, May 18-21, 1993, San Diego, California, United States
Matthew T. Dickerson , Robert L. Scot Drysdale , Scott A. McElfresh , Emo Welzl, Fast greedy triangulation algorithms, Proceedings of the tenth annual symposium on Computational geometry, p.211-220, June 06-08, 1994, Stony Brook, New York, United States
M. D. Grigoriadis , B. Kalantari, A new class of heuristic algorithms for weighted perfect matching, Journal of the ACM (JACM), v.35 n.4, p.769-776, Oct. 1988
Edgar A. Ramos, Deterministic algorithms for 3-D diameter and some 2-D lower envelopes, Proceedings of the sixteenth annual symposium on Computational geometry, p.290-299, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Donhui Zhang , Alexander Markowetz , Vassilis Tsotras , Dimitrios Gunopulos , Bernhard Seeger, Efficient computation of temporal aggregates with range predicates, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.237-245, May 2001, Santa Barbara, California, United States
K. L. Liu , G. J. Lipovski , C. Yu , Naphtali Rishe, Efficient processing of one and two dimensional proximity queries in associative memory, Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval, p.138-146, August 18-22, 1996, Zurich, Switzerland
Jie Gao , Leonidas Guibas , John Hershberger , Li Zhang , An Zhu, Discrete mobile centers, Proceedings of the seventeenth annual symposium on Computational geometry, p.188-196, June 2001, Medford, Massachusetts, United States
A. M. Day, The implementation of an algorithm to find the convex hull of a set of three-dimensional points, ACM Transactions on Graphics (TOG), v.9 n.1, p.105-132, Jan. 1990
Jan Vahrenhold , Klaus H. Hinrichs, Planar point location for large data sets: to seek or not to seek, Journal of Experimental Algorithmics (JEA), 7, p.8, 2002
Karla A. V. Borges , Clodoveu A. Davis, Jr. , Alberto H. F. Laender, Integrity constraints in spatial databases, Database integrity: challenges and solutions, Idea Group Publishing, Hershey, PA, 2002
B. Crespin, Dynamic triangulation of variational implicit surfaces using incremental Delaunay tetrahedralization, Proceedings of the 2002 IEEE symposium on Volume visualization and graphics, October 28-29, 2002, Boston, Massachusetts
Ibraheem Al-Furaih , Srinivas Aluru , Sanjay Goil , Sanjay Ranka, Parallel construction of multidimensional binary search trees, Proceedings of the 10th international conference on Supercomputing, p.205-212, May 25-28, 1996, Philadelphia, Pennsylvania, United States
Jyh-Jong Fu , R. C. T. Lee, Minimum Spanning Trees of Moving Points in the Plane, IEEE Transactions on Computers, v.40 n.1, p.113-118, January 1991
Jonathan D. Cohen , Ming C. Lin , Dinesh Manocha , Madhav Ponamgi, I-COLLIDE: an interactive and exact collision detection system for large-scale environments, Proceedings of the 1995 symposium on Interactive 3D graphics, p.189-ff., April 09-12, 1995, Monterey, California, United States
G. Sampath, An algorithm to compute the convex hull in the plane from the distance matrix, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
Edwin M. Knorr , Raymond T. Ng, Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining, IEEE Transactions on Knowledge and Data Engineering, v.8 n.6, p.884-897, December 1996
Gabriel Zachmann, Minimal hierarchical collision detection, Proceedings of the ACM symposium on Virtual reality software and technology, November 11-13, 2002, Hong Kong, China
Sung Kwon Kim, Linear-time algorithm for finding a maximum-density segment of a sequence, Information Processing Letters, v.86 n.6, p.339-342, 30 June 2003
Hyoseop Shin , Bongki Moon , Sukho Lee, Adaptive and Incremental Processing for Distance Join Queries, IEEE Transactions on Knowledge and Data Engineering, v.15 n.6, p.1561-1578, November 2003
Kelly A. Lyons , Henk Meijer , David Rappaport, Properties of the voronoi diagram cluster buster, Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing, October 24-28, 1993, Toronto, Ontario, Canada
M. Sarrafzadeh , C. K. Wong, Bottleneck Steiner Trees in the Plane, IEEE Transactions on Computers, v.41 n.3, p.370-374, March 1992
V. Kamakoti , Kamala Krithivasan , C. Pandu Rangan, An efficient randomized algorithm for the closest pair problem on colored point sets, Nordic Journal of Computing, v.2 n.1, p.28-40, March 1995
Nancy M. Amato , Franco P. Preparata, An NC parallel 3D convex hull algorithm, Proceedings of the ninth annual symposium on Computational geometry, p.289-297, May 18-21, 1993, San Diego, California, United States
Gene Myers, Comparing sequence scaffolds, Proceedings of the fifth annual international conference on Computational biology, p.224-230, April 22-25, 2001, Montreal, Quebec, Canada
Amitabh Varshney , Frederick P. Brooks, Jr. , William V. Wright, Computing Smooth Molecular Surfaces, IEEE Computer Graphics and Applications, v.14 n.5, p.19-25, September 1994
E. Wolfson , E. L. Schwartz, Computing Minimal Distances on Polyhedral Surfaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.9, p.1001-1005, September 1989
Y. F. Wang, Characterizing Three-Dimensional Surface Structures from Visual Images, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.1, p.52-60, January 1991
Leila De Floriani, A Pyramidal Data Structure for Triangle-Based Surface Description, IEEE Computer Graphics and Applications, v.9 n.2, p.67-78, March 1989
Timothy M. Chan, Dynamic subgraph connectivity with geometric applications, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
X. Wu , J. Rokne, On Properties of Discretized Convex Curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.2, p.217-223, February 1989
Ten H. Lai , Ming-Jye Sheng, Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes, IEEE Transactions on Parallel and Distributed Systems, v.7 n.8, p.806-817, August 1996
Christian Ronse, A Bibliography on Digital and Computational Convexity (1961-1988), IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.2, p.181-190, February 1989
N G Sullivan , J B Rosenberg, The cookie cutter algorithm for handling mixed hierarchy, ACM SIGDA Newsletter, v.17 n.2, p.41-52, June 1987
Ju-wook Jang , Madhusudan Nigam , Viktor K. Prasanna , Sartaj Sahni, Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh, IEEE Transactions on Parallel and Distributed Systems, v.8 n.1, p.1-12, January 1997
Jose Salinas , Yinan Shen , Fabrizio Lombardi, A Sweeping Line Approach to Interconnect Testing, IEEE Transactions on Computers, v.45 n.8, p.917-929, August 1996
Adam L. Buchsbaum , Glenn S. Fowler , Balachannder Kirishnamurthy , Kiem-Phong Vo , Jia Wang, Fast prefix matching of bounded strings, Journal of Experimental Algorithmics (JEA), 8, 2003
M. Sarrafzadeh , D. T. Lee, Topological Via Minimization Revisited, IEEE Transactions on Computers, v.40 n.11, p.1307-1312, November 1991
Paul L. Rosin, Fitting Superellipses, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.22 n.7, p.726-732, July 2000
P. Meer , C. A. Sher , A. Rosenfeld, The Chain Pyramid: Hierarchical Contour Processing, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.4, p.363-376, April 1990
Peter D. Holmes , Erland R. A. Jungert, Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.5, p.549-565, May 1992
E. Chicurel-Uziel, Single equation without inequalities to represent a composite curve, Computer Aided Geometric Design, v.21 n.1, p.23-42, January 2004
Joachim Gudmundsson , Thore Husfeldt , Christos Levcopoulos, Lower bounds for approximate polygon decomposition and minimum gap, Information Processing Letters, v.81 n.3, p.137-141, 14 February 2002
Fenglien Lee , Richard Jou, Efficient parallel geometric algorithms on a mesh of trees, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina
Dwight S. Wilson , Gregory F. Sullivan , Gerald M. Masson, Certification of Computational Results, IEEE Transactions on Computers, v.44 n.7, p.833-847, July 1995
Paolo Cignoni , Paola Marino , Claudio Montani , Enrico Puppo , Roberto Scopigno, Speeding Up Isosurface Extraction Using Interval Trees, IEEE Transactions on Visualization and Computer Graphics, v.3 n.2, p.158-170, April 1997
Michael A. Erdmann, Protein similarity from knot theory and geometric convolution, Proceedings of the eighth annual international conference on Resaerch in computational molecular biology, p.195-204, March 27-31, 2004, San Diego, California, USA
Claudio T. Silva , Joseph S. B. Mitchell, The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids, IEEE Transactions on Visualization and Computer Graphics, v.3 n.2, p.142-157, April 1997
Boting Yang , Cao An Wang, Detecting tetrahedralizations of a set of line segments, Journal of Algorithms, v.53 n.1, p.1-35, October 2004
A. Voisard , B. David, A Database Perspective on Geospatial Data Modeling, IEEE Transactions on Knowledge and Data Engineering, v.14 n.2, p.226-243, March 2002
Kevin J. Renze , James H. Oliver, Generalized Unstructured Decimation, IEEE Computer Graphics and Applications, v.16 n.6, p.24-32, November 1996
Kelly A. Lyons, Cluster busting in anchored graph drawing, Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research, November 09-12, 1992, Toronto, Ontario, Canada
Gautam Das , Paul J. Heffernan , Giri Narasimhan, Finding all weakly-visible chords of a polygon in linear time, Nordic Journal of Computing, v.1 n.4, p.433-457, Winter 1994
Yong Xue , Min Sun , Ainai Ma, On the reconstruction of three-dimensional complex geological objects using Delaunay triangulation, Future Generation Computer Systems, v.20 n.7, p.1227-1234, October 2004
J. K. Johnstone, Giftwrapping a curve with the convex hull, Proceedings of the 42nd annual Southeast regional conference, April 02-03, 2004, Huntsville, Alabama
Patrick J. Moran , Marcus Wagner, Introducing alpha shapes for the analysis of path integral Monte Carlo results, Proceedings of the conference on Visualization '94, October 17-21, 1994, Washinton, D.C.
Michael Margaliot , Craig Gotsman, Piecewise-linear surface approximation from noisy scattered samples, Proceedings of the conference on Visualization '94, October 17-21, 1994, Washinton, D.C.
Abdullah Zawawi Talib , Ahmad Izani Md. Ismail , Min Chen, Efficient implementation of a planar point location method, Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia, June 15-18, 2004, Singapore
Parivallal Kannan , Shankar Balachandran , Dinesh Bhatia, On metrics for comparing interconnect estimation methods for FPGAs, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.12 n.4, p.381-385, April 2004
Inbok Lee , Kunsoo Park , Yanghee Choi , Sung Kwon Chung, A simple and scalable algorithm for the IP address lookup problem, Fundamenta Informaticae, v.56 n.1,2, p.181-190, July 2003
Riky Subrata , Albert Y. Zomaya, Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting, Journal of Parallel and Distributed Computing, v.63 n.12, p.1300-1314, December 2003
Daniel B. Neill , Andrew W. Moore, Rapid detection of significant spatial clusters, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
Michael R. Bartolacci , Boris Peltsverger , Abdullah Konak , Svetlana Peltsverger, Allocation of multiple wireless access points in mobile networks, Proceedings of the 42nd annual Southeast regional conference, April 02-03, 2004, Huntsville, Alabama
Ting Liu , Ke Yang , Andrew W. Moore, The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
Kiarash Bazargan , Ryan Kastner , Majid Sarrafzadeh, Fast Template Placement for Reconfigurable Computing Systems, IEEE Design & Test, v.17 n.1, p.68-83, January 2000
Subhas C. Nandy , Tetsuo Asano , Tomohiro Harayama, Shattering a set of objects in 2D, Discrete Applied Mathematics, v.122 n.1-3, p.183-194, 15 October 2002
Aldo Laurentini, How Far 3D Shapes Can Be Understood from 2D Silhouettes, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.2, p.188-195, February 1995
Michael T. Goodrich , Joseph S. B. Mitchell , Mark W. Orletsky, Approximate Geometric Pattern Matching Under Rigid Motions, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.21 n.4, p.371-379, April 1999
Vassilis J. Tsotras , B. Gopinath , George W. Hart, Efficient Management of Time-Evolving Databases, IEEE Transactions on Knowledge and Data Engineering, v.7 n.4, p.591-608, August 1995
Calvin R. Maurer, Jr. , Rensheng Qi , Vijay Raghavan, A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.25 n.2, p.265-270, February 2003
Suchendra M. Bhandarkar , Tongzhang Jiang , Kunal Verma , Nan Li, Automated analysis of DNA hybridization images for high-throughput genomics, Machine Vision and Applications, v.15 n.3, p.121-138, July 2004
J. Mark Keil , Patrice Belleville, Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs, Discrete Applied Mathematics, v.140 n.1-3, p.73-89, 15 May 2004
Hanan Samet, Object-based and image-based object representations, ACM Computing Surveys (CSUR), v.36 n.2, p.159-217, June 2004
Ferran Hurtado , Mercè Mora , Pedro A. Ramos , Carlos Seara, Separability by two lines and by nearly straight polygonal chains, Discrete Applied Mathematics, v.144 n.1-2, p.110-122, 30 November 2004
Mordecai Golin , Rajeev Raman , Christian Schwarz , Michiel Smid, Simple randomized algorithms for closest pair problems, Nordic Journal of Computing, v.2 n.1, p.3-27, March 1995
Hervé Delingette, General Object Reconstruction Based on Simplex Meshes, International Journal of Computer Vision, v.32 n.2, p.111-146, Aug. 1999
J. J. Little , G. E. Blelloch , T. A. Cass, Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.3, p.244-257, March 1989
R. Fabbri , L. F. Estrozi , L. Da F. Costa, On Voronoi Diagrams and Medial Axes, Journal of Mathematical Imaging and Vision, v.17 n.1, p.27-40, July 2002
Alexandre X. Falcão , Jorge Stolfi , Roberto de Alencar Lotufo, The Image Foresting Transform: Theory, Algorithms, and Applications, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.26 n.1, p.19-29, January 2004
M. Lindenbaum , A. Bruckstein, On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.9, p.949-953, September 1993
G. D. Finalyson, Color in Perspective, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.10, p.1034-1038, October 1996
Martin S. Maltz, Tetrahedralization of Point Sets Using Expanding Spheres, IEEE Transactions on Visualization and Computer Graphics, v.11 n.1, p.102-109, January 2005
Sheng Zhou , Christopher B. Jones, HCPO: an efficient insertion order for incremental Delaunay triangulation, Information Processing Letters, v.93 n.1, p.37-42, 16 January 2005
N. Dyn , M. S. Floater , A. Iske, Adaptive thinning for bivariate scattered data, Journal of Computational and Applied Mathematics, v.145 n.2, p.505-517, August 2002
A New Convexity Measure for Polygons, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.26 n.7, p.923-934, July 2004
Koji Nakano , Stephen Olariu, An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications, IEEE Transactions on Parallel and Distributed Systems, v.8 n.9, p.983-990, September 1997
J. Schwerdt , M. Smid , J. Majhi , R. Janardan, Computing the width of a three-dimensional point set: an experimental study, Journal of Experimental Algorithmics (JEA), 4, p.8-es, 1999
Ding-Kai Chen , Pen-Chung Yew, On Effective Execution of Nonuniform DOACROSS Loops, IEEE Transactions on Parallel and Distributed Systems, v.7 n.5, p.463-476, May 1996
Dominique Michelucci , Jean-Michel Moreau, Lazy Arithmetic, IEEE Transactions on Computers, v.46 n.9, p.961-975, September 1997
R. Lin , S. Olariu , J. L. Schwing , B.-F. Wang, The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry, IEEE Transactions on Parallel and Distributed Systems, v.10 n.3, p.266-280, March 1999
J. L. Prince , A. S. Willsky, Reconstructing Convex Sets from Support Line Measurements, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.4, p.377-389, April 1990
Venkatavasu Bokka , Himabindu Gurla , Stephan Olariu , James L. Schwing, Podality-Based Time-Optimal Computations on Enhanced Meshes, IEEE Transactions on Parallel and Distributed Systems, v.8 n.10, p.1019-1035, October 1997
Marian Neamtu, What is the natural generalization of univariate splines to higher dimensions?, Mathematical Methods for Curves and Surfaces: Oslo 2000, Vanderbilt University, Nashville, TN, 2001
R. Miller , Q. F. Stout, Mesh Computer Algorithms for Computational Geometry, IEEE Transactions on Computers, v.38 n.3, p.321-340, March 1989
Tatsuya Hayashi , Koji Nakano , Stephen Olariu, An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes, IEEE Transactions on Parallel and Distributed Systems, v.9 n.12, p.1167-1179, December 1998
Majid Sarrafzadeh , Wei-Liang Lin , C. K. Wong, Floating Steiner Trees, IEEE Transactions on Computers, v.47 n.2, p.197-211, February 1998
Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu, An Efficient k-Means Clustering Algorithm: Analysis and Implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.7, p.881-892, July 2002
F.-C. Lin , K. Chen, On the Design of a Unidirectional Systolic Array for Key Enumeration, IEEE Transactions on Computers, v.39 n.2, p.266-269, February 1990
Larry L. Schumaker, Triangulations in CAGD, IEEE Computer Graphics and Applications, v.13 n.1, p.47-52, January 1993
Sang-Wook Kim , Jeehee Yoon , Sanghyun Park , Tae-Hoon Kim, Shape-based retrieval of similar subsequences in time-series databases, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
Todd A. Cass, Polynomial-Time Geometric Matching for Object Recognition, International Journal of Computer Vision, v.21 n.1-2, p.37-61, January. 1997
Dharmavani Bhagavathi , Venkata V. Bokka , Himabindu Gurla , Stephan Olariu , James L. Schwing , Ivan Stojmenovic , Jingyuan Zhang, Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting, IEEE Transactions on Parallel and Distributed Systems, v.6 n.7, p.687-703, July 1995
J.-R. de Dreuzy , J. Erhel, Efficient algorithms for the determination of the connected fracture network and the solution to the steady-state flow equation in fracture networks, Computers & Geosciences, v.29 n.1, p.107-111, February 2003
Brent M. Dennis , Christopher G. Healey, Assisted navigation for large information spaces, Proceedings of the conference on Visualization '02, October 27-November 01, 2002, Boston, Massachusetts
John Hershberger , Subhash Suri, Adaptive sampling for geometric problems over data streams, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 14-16, 2004, Paris, France
Claus-Peter Alberts, Surface reconstruction from scan paths, Future Generation Computer Systems, v.20 n.8, p.1285-1298, November 2004
Marcel Worring , Arnold W. M. Smeulders, Digitized Circular Arcs: Characterization and Parameter Estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.6, p.587-598, June 1995
M. J. Fadili , M. Melkemi , A. ElMoataz, Non-convex onion-peeling using a shape hull algorithm, Pattern Recognition Letters, v.25 n.14, p.1577-1585, 15 October 2004
Stefan Berchtold , Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl, Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.45-57, January 2000
Eric Saux , Rémy Thibaud , Ki-Joune Li , Min-Hwan Kim, A new approach for a topographic feature-based characterization of digital elevation data, Proceedings of the 12th annual ACM international workshop on Geographic information systems, November 12-13, 2004, Washington DC, USA
Philip M. Hubbard, Collision Detection for Interactive Graphics Applications, IEEE Transactions on Visualization and Computer Graphics, v.1 n.3, p.218-230, September 1995
James T. Klosowski , Martin Held , Joseph S. B. Mitchell , Henry Sowizral , Karel Zikan, Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs, IEEE Transactions on Visualization and Computer Graphics, v.4 n.1, p.21-36, January 1998
Richard J. Howarth, Spatial Models for Wide-Area Visual Surveillance: Computational Approaches and Spatial Building-Blocks, Artificial Intelligence Review, v.23 n.2, p.97-155, April 2005
Frank Guangsheng Zhang , Emanuel Melachrinoudis, The Maximin-Maxisum Network Location Problem, Computational Optimization and Applications, v.19 n.2, p.209-234, July 2001
Pat Morin , Jason Morrison, The geometry of carpentry and joinery, Discrete Applied Mathematics, v.144 n.3, p.374-380, 15 December 2004
Min Gyu Choi , Jehee Lee , Sung Yong Shin, Planning biped locomotion using motion capture data and probabilistic roadmaps, ACM Transactions on Graphics (TOG), v.22 n.2, p.182-203, April 2003
Otfried Cheong , Chan-Su Shin , Antoine Vigneron, Computing farthest neighbors on a convex polytope, Theoretical Computer Science, v.296 n.1, p.47-58, 4 March 2003
Donghui Zhang , Vassilis J. Tsotras, Improving min/max aggregation over spatial objects, Proceedings of the 9th ACM international symposium on Advances in geographic information systems, November 09-10, 2001, Atlanta, Georgia, USA
Bradley A. Payne , Arthur W. Toga, Distance Field Manipulation of Surface Models, IEEE Computer Graphics and Applications, v.12 n.1, p.65-71, January 1992
Xin Zhang , Nikos Mamoulis , David W. Cheung , Yutao Shou, Fast mining of spatial collocations, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
Dharmavani Bhagavathi , Himabindu Gurla , Stephan Olariu , James L. Schwing , Jingyuan Zhang, Square Meshes Are Not Optimal for Convex Hull Computation, IEEE Transactions on Parallel and Distributed Systems, v.7 n.6, p.545-554, June 1996
Raymond T. Ng , Jiawei Han, CLARANS: A Method for Clustering Objects for Spatial Data Mining, IEEE Transactions on Knowledge and Data Engineering, v.14 n.5, p.1003-1016, September 2002
Friedrich Hubalek , Hsien-Kuei Hwang , William Lew , Hosam Mahmoud , Helmut Prodinger, A multivariate view of random bucket digital search trees, Journal of Algorithms, v.44 n.1, p.121-158, July 2002
Hervé Brönnimann , John Iacono , Jyrki Katajainen , Pat Morin , Jason Morrison , Godfried Toussaint, Space-efficient planar convex hull algorithms, Theoretical Computer Science, v.321 n.1, p.25-40, June 16, 2004
Yasuhiko Morimoto , Takeshi Fukuda , Takeshi Tokuyama, Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases, IEEE Transactions on Knowledge and Data Engineering, v.14 n.6, p.1269-1279, November 2002
Nikos Mamoulis , Dimitris Papadias, Slot Index Spatial Join, IEEE Transactions on Knowledge and Data Engineering, v.15 n.1, p.211-231, January 2003
Heinz Breu , Joseph Gil , David Kirkpatrick , Michael Werman, Linear Time Euclidean Distance Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.5, p.529-533, May 1995
G. Millerioux , F. Anstett , G. Bloch, Considering the attractor structure of chaotic maps for observer-based synchronization problems, Mathematics and Computers in Simulation, v.68 n.1, p.67-85, 3 February 2005
D. K. Tasoulis , M. N. Vrahatis, Unsupervised clustering on dynamic databases, Pattern Recognition Letters, v.26 n.13, p.2116-2127, 1 October 2005
Andrzej Lingas , Martin Wahlen, A note on maximum independent set and related problems on box graphs, Information Processing Letters, v.93 n.4, p.169-171, 28 February 2005
Joseph M. Shapiro , Gary B. Lamont , Gilbert L. Peterson, An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection, Proceedings of the 2005 conference on Genetic and evolutionary computation, June 25-29, 2005, Washington DC, USA
Hussein M. Alnuweiri , Viktor K. Prasanna, Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays, Distributed Computing, v.5 n.2, p.55-65, September 1991
Timothy M. Chan , Eric Y. Chen, Multi-pass geometric algorithms, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy
Ruy Fabila Monroy , J. Urrutia, Graham triangulations and triangulations with a center are hamiltonean, Information Processing Letters, v.93 n.6, p.295-299, 31 March 2005
Godfried Toussaint, The Erdős-Nagy theorem and its ramifications, Computational Geometry: Theory and Applications, v.31 n.3, p.219-236, June 2005
Fabrizio Angiulli , Clara Pizzuti, An approximate algorithm for top-k closest pairs join query in large high dimensional data, Data & Knowledge Engineering, v.53 n.3, p.263-281, June 2005
Jeff Erickson, Lower bounds for external algebraic decision trees, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
Fabrizio Angiulli , Clara Pizzuti, Outlier Mining in Large High-Dimensional Data Sets, IEEE Transactions on Knowledge and Data Engineering, v.17 n.2, p.203-215, February 2005
Marc Niethammer , Santiago Betelu , Guillermo Sapiro , Allen Tannenbaum , Peter J. Giblin, Area-Based Medial Axis of Planar Curves, International Journal of Computer Vision, v.60 n.3, p.203-224, December 2004
Purnamrita Sarkar , Andrew W. Moore, Dynamic social network analysis using latent space models, ACM SIGKDD Explorations Newsletter, v.7 n.2, p.31-40, December 2005
Borut Žalik , Mirko Zadravec , Gordon J. Clapworthy, Construction of a non-symmetric geometric buffer from a set of line segments, Computers & Geosciences, v.29 n.1, p.53-63, February 2003
Ferenc Kahlesz , Ákos Balázs , Reinhard Klein, Multiresolution rendering by sewing trimmed NURBS surfaces, Proceedings of the seventh ACM symposium on Solid modeling and applications, June 17-21, 2002, Saarbrücken, Germany
I. J. Cox , J. B. Kruskal , D. A. Wallach, Predicting and Estimating the Accuracy of a Subpixel Registration Algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.8, p.721-734, August 1990
Pierre Alliez , Éric Colin de Verdière , Olivier Devillers , Martin Isenburg, Centroidal Voronoi diagrams for isotropic surface remeshing, Graphical Models, v.67 n.3, p.204-231, May 2005
Marcello A. Anile , Primo Furno , Giovanni Gallo , Alessandro Massolo, A fuzzy approach to visibility maps creation over digital terrains, Fuzzy Sets and Systems, v.135 n.1, p.63-80, April 1, 2003
Micha Sharir, The interface between computational and combinatorial geometry, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
Gopi K. Attaluri, An efficient expected cost algorithm for dynamic indexing of spatial objects, Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research, p.2, October 31-November 03, 1994, Toronto, Ontario, Canada
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, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy
Hüseyin Tek , Benjamin B. Kimia, Symmetry Maps of Free-Form Curve Segments via Wave Propagation, International Journal of Computer Vision, v.54 n.1-3, p.35-81, August-September 2003
Adam Runions , Martin Fuhrer , Brendan Lane , Pavol Federl , Anne-Gaëlle Rolland-Lagan , Przemyslaw Prusinkiewicz, Modeling and visualization of leaf venation patterns, ACM Transactions on Graphics (TOG), v.24 n.3, July 2005
Maik Flanagin , Aurélien Grenotton , Jay Ratcliff , Mahdi Abdelguerfi , Kevin Shaw, Automated terrain generation using LIDAR and waterbody survey data, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
Ulrich Eckhardt, Digital lines and digital convexity, Digital and image geometry: advanced lectures, Springer-Verlag New York, Inc., New York, NY, 2001
Ross T. Whitaker , Jens Gregor, A Maximum-Likelihood Surface Estimator for Dense Range Data, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.10, p.1372-1387, October 2002
Xuehong Sun , Sartaj K. Sahni , Yiqiang Q. Zhao, Packet classification consuming small amount of memory, IEEE/ACM Transactions on Networking (TON), v.13 n.5, p.1135-1145, October 2005
Chee-Yong Chan , Pin-Kwang Eng , Kian-Lee Tan, Stratified computation of skylines with partially-ordered domains, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
Hee-Kap Ahn , Otfried Cheong , Chan-Su Shin, Building bridges between convex regions, Computational Geometry: Theory and Applications, v.25 n.1-2, p.161-170, May 2003
Kevin R. Glass , Chantelle Morkel , Shaun D. Bangay, Duplicating road patterns in south african informal settlements using procedural techniques, Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, January 25-27, 2006, Cape Town, South Africa
Dimitris Papadias , Yufei Tao , Greg Fu , Bernhard Seeger, Progressive skyline computation in database systems, ACM Transactions on Database Systems (TODS), v.30 n.1, p.41-82, March 2005
Frank Wolter , Michael Zakharyaschev, Qualitative spatiotemporal representation and reasoning: a computational perspective, Exploring artificial intelligence in the new millennium, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2003
Maria Lucia Sampoli, Computing the convolution and the Minkowski sum of surfaces, Proceedings of the 21st spring conference on Computer graphics, May 12-14, 2005, Budmerice, Slovakia
Kai Tang , Yong-Jin Liu, An optimization algorithm for free-form surface partitioning based on weighted Gaussian image, Graphical Models, v.67 n.1, p.17-42, January 2005
J.-K. Seong , G. Elber , J. K. Johnstone , M.-S. Kim, The convex hull of freeform surfaces, Computing, v.72 n.1-2, p.171-183, April 2004
Timothy M. Chan, A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.1196-1202, January 22-26, 2006, Miami, Florida
Lining Yang , Roger Crawfis, Rail-track viewer: an image-based virtual walkthrough system, Proceedings of the workshop on Virtual environments 2002, May 30-31, 2002, Barcelona, Spain
Amitava Datta , Kamala Krithivasan , Thomas Ottmann, An optimal algorithm for one-separation of a set of isothetic polygons, Information Sciences—Informatics and Computer Science: An International Journal, v.164 n.1-4, p.65-88, 2 August 2004
S. J. Wan , S. K. M. Wong, A Partially Supervised Learning Algorithm for Linearly Separable Systems, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.10, p.1052-1056, October 1992
R. Miller , Q. F. Stout, Efficient Parallel Convex Hull Algorithms, IEEE Transactions on Computers, v.37 n.12, p.1605-1618, December 1988
Moshe Dror , Alon Efrat , Anna Lubiw , Joseph S. B. Mitchell, Touring a sequence of polygons, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
Elmar Schömer , Nicola Wolpert, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry: Theory and Applications, v.33 n.1-2, p.65-97, January 2006
A. V. Ramesh , Kishor Trivedi, Semi-numerical transient analysis of Markov models, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina
Yuh-Rau Wang , Shi-Jinn Horng , Chin-Hsiung Wu, Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System, IEEE Transactions on Parallel and Distributed Systems, v.16 n.3, p.193-206, March 2005
Stephan Olariu , Albert Y. Zomaya, A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications, IEEE Transactions on Parallel and Distributed Systems, v.7 n.10, p.1009-1025, October 1996
V. K. Prasanna-Kumar , D. I. Reisis, Image Computations on Meshes with Multiple Broadcast, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.11, p.1194-1202, November 1989
David Eggert , Kevin Bowyer, Computing the Perspective Projection Aspect Graph of Solids of Revolution, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.2, p.109-128, February 1993
Raghu R. Karinthi , Dana Nau, An Algebraic Approach to Feature Interactions, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.4, p.469-484, April 1992
Sudipto Guha , H. V. Jagadish , Nick Koudas , Divesh Srivastava , Ting Yu, Integrating XML data sources using approximate joins, ACM Transactions on Database Systems (TODS), v.31 n.1, p.161-207, March 2006
Dmitriy V. Pinskiy , Joerg Meyer , Bernd Hamann , Kenneth I. Joy , Eric Brugger , Mark Duchaineau, A hierarchical error controlled octree data structure for large-scale visualization, Crossroads, v.6 n.3, p.26-31, Spring 2000
Nasser Yazdani , Z. Meral Özsoyoglu , Gultekin Özsoyoglu, A framework for feature-based indexing for spatial databases, Proceedings of the 7th international conference on Scientific and Statistical Database Management, p.259-269, September 28-30, 1994, Charlottesville, Virginia
Robert Laurini , Françoise Milleret, Spatial data base queries: relational algebra versus computational geometry, Proceedings of the 4th international conference on Statistical and Scientific Database Management, p.291-313, June 21-23, 1988, Rome, Italy
Ovidiu Daescu , Jun Luo , David M. Mount, Proximity problems on line segments spanned by points, Computational Geometry: Theory and Applications, v.33 n.3, p.115-129, February 2006
Mark de Berg , Micha Streppel, Approximate range searching using binary space partitions, Computational Geometry: Theory and Applications, v.33 n.3, p.139-151, February 2006
Ovidiu Daescu , Ningfang Mi , Chan-Su Shin , Alexander Wolff, Farthest-point queries with geometric and combinatorial constraints, Computational Geometry: Theory and Applications, v.33 n.3, p.174-185, February 2006
D. Coeurjolly , I. Sivignon , F. Dupont , F. Feschet , J.-M. Chassery, On digital plane preimage structure, Discrete Applied Mathematics, v.151 n.1-3, p.78-92, 1 October 2005
Jiří Matoušek, Geometric range searching, ACM Computing Surveys (CSUR), v.26 n.4, p.422-461, Dec. 1994
Oswin Aichholzer , Franz Aurenhammer , Thomas Hackl, Pre-triangulations and liftable complexes, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
Sang-Wook Kim , Jeehee Yoon , Sanghyun Park , Jung-Im Won, Shape-based retrieval in time-series databases, Journal of Systems and Software, v.79 n.2, p.191-203, February 2006
Zhenming Chen , Evanthia Papadopoulou , Jinhui Xu, Robustness of k-gon Voronoi diagram construction, Information Processing Letters, v.97 n.4, p.138-145, 28 February 2006
William J. Schroeder , Jonathan A. Zarge , William E. Lorensen, Decimation of triangle meshes, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.65-70, July 1992
G. D. Finlayson , S. D. Hordley , I. Tastl, Gamut Constrained Illuminant Estimation, International Journal of Computer Vision, v.67 n.1, p.93-109, April 2006
B. C. Vemuri , R. Varadarajan , N. Mayya, An efficient expected time parallel algorithm for Voronoi construction, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.392-401, June 29-July 01, 1992, San Diego, California, United States
Yu Wang , Xiang-Yang Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks, Mobile Networks and Applications, v.11 n.2, p.161-175, April 2006
Qing Fang , Jie Gao , Leonidas J. Guibas, Locating and bypassing holes in sensor networks, Mobile Networks and Applications, v.11 n.2, p.187-200, April 2006
Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert, Exact, efficient, and complete arrangement computation for cubic curves, Computational Geometry: Theory and Applications, v.35 n.1, p.36-73, August 2006
Feng Xue , P. R. Kumar, On the θ-coverage and connectivity of large random networks, IEEE/ACM Transactions on Networking (TON), v.14 n.SI, p.2289-2299, June 2006
Steven M. Seitz , Kiriakos N. Kutulakos, Plenoptic Image Editing, International Journal of Computer Vision, v.48 n.2, p.115-129, July 2002
Christopher G. Atkeson , Andrew W. Moore , Stefan Schaal, Locally Weighted Learning for Control, Artificial Intelligence Review, v.11 n.1-5, p.75-113, Feb. 1997
Stephen M. Pizer , Kaleem Siddiqi , Gabor Székely , James N. Damon , Steven W. Zucker, Multiscale Medial Loci and Their Properties, International Journal of Computer Vision, v.55 n.2-3, p.155-179, November-December 2003
George Gagaudakis , Paul L. Rosin, Shape measures for image retrieval, Pattern Recognition Letters, v.24 n.15, p.2711-2721, November 2003
S. Di Zenzo , L. Cinque , S. Levialdi, Run-Based Algorithms for Binary Image Analysis and Processing, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.1, p.83-89, January 1996
Xuemin Lin , Jian Xu , Qing Zhang , Hongjun Lu , Jeffrey Xu Yu , Xiaofang Zhou , Yidong Yuan, Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams, IEEE Transactions on Knowledge and Data Engineering, v.18 n.5, p.683-698, May 2006
Frank Nielsen, On point covers of c-oriented polygons, Theoretical Computer Science, v.263 n.1-2, p.17-29, July 28 2001
Tatsuya Hayashi , Koji Nakano , Stephan Olariu, Optimal Parallel Algorithms for Finding Proximate Points, with Applications, IEEE Transactions on Parallel and Distributed Systems, v.9 n.12, p.1153-1166, December 1998
A. Corral , Y. Manolopoulos , Y. Theodoridis , M. Vassilakopoulos, Algorithms for processing K-closest-pair queries in spatial databases, Data & Knowledge Engineering, v.49 n.1, p.67-104, 1 April 2004
M. Lindenbaum , J. Koplowitz, A New Parameterization of Digital Straight Lines, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.8, p.847-852, August 1991
Holger Petersen, Bounds for the element distinctness problem on one-tape Turing machines, Information Processing Letters, v.81 n.2, p.75-79, 31 January 2002
Laurent Demaret , Nira Dyn , Armin Iske, Image compression by linear splines over adaptive triangulations, Signal Processing, v.86 n.7, p.1604-1616, July 2006
Oliver Gunther , Salvador Dominguez, The Performance of Curve Representation Schemes, IEEE Computer Graphics and Applications, v.13 n.3, p.55-63, May 1993
V. Robins , J. Abernethy , N. Rooney , E. Bradley, Topology and intelligent data analysis, Intelligent Data Analysis, v.8 n.5, p.505-515, October 2004
Annalisa Appice , Michelangelo Ceci , Antonietta Lanza , Francesca A. Lisi , Donato Malerba, Discovery of spatial association rules in geo-referenced census data: A relational mining approach, Intelligent Data Analysis, v.7 n.6, p.541-566, December 2003
Hesam Najafi , Nassir Navab , Gudrun Klinker, Automated Initialization for Marker-Less Tracking: A Sensor Fusion Approach, Proceedings of the 3rd IEEE/ACM International Symposium on Mixed and Augmented Reality, p.79-88, November 02-05, 2004
Shashi Shekhar , Chang-Tien Lu , Pusheng Zhang, Detecting graph-based spatial outliers, Intelligent Data Analysis, v.6 n.5, p.451-468, October 2002
Hisamoto Hiyoshi , Kokichi Sugihara, Smooth natural neighbour interpolants over the whole domain, International Journal of Computational Science and Engineering, v.3 n.1, p.3-13, July 2007
Lutz Plümer , Gerhard Gröger, Achieving Integrity in Geographic Information Systems—Maps and Nested Maps, Geoinformatica, v.1 n.4, p.345-367, December 1997
Apostolos Papadopoulos , Yannis Manolopoulos, Nearest Neighbor Queries in Shared-Nothing Environments, Geoinformatica, v.1 n.4, p.369-392, December 1997
Yee Leung , Jianping Yan, Point-in-Polygon Analysis Under Certainty and Uncertainty, Geoinformatica, v.1 n.1, p.93-114, April 1997
Michel Couprie , David Coeurjolly , Rita Zrour, Discrete bisector function and Euclidean skeleton in 2D and 3D, Image and Vision Computing, v.25 n.10, p.1543-1556, October, 2007
Leila De Floriani , Paola Magillo, Visibility Computations on Hierarchical Triangulated Terrain Models, Geoinformatica, v.1 n.3, p.219-250, October 1997
Yun-Wu Huang , Matthew Jones , Elke A. Rundensteiner, Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins, Geoinformatica, v.2 n.2, p.149-174, June 1998
Xiaofang Zhou , David J. Abel , David Truffet, Data Partitioning for Parallel Spatial Join Processing, Geoinformatica, v.2 n.2, p.175-204, June 1998
Nisheeth Shrivastava , Subhash Suri , Csaba D. Tóth, Detecting cuts in sensor networks, ACM Transactions on Sensor Networks (TOSN), v.4 n.2, p.1-25, March 2008
Alan Saalfeld, Sorting Spatial Data for Sampling and Other Geographic Applications, Geoinformatica, v.2 n.1, p.37-57, March 1998
Paris Kanellakis, Database querying and constraint programming, ACM SIGACT News, v.25 n.4, p.22-87, Dec. 1994
Nikos Mamoulis , Dimitris Papadias , Dinos Arkoumanis, Complex Spatial Query Processing, Geoinformatica, v.8 n.4, p.311-346, December 2004
Antonio Corral , Yannis Manolopoulos , Yannis Theodoridis , Michael Vassilakopoulos, Multi-Way Distance Join Queries in Spatial Databases, Geoinformatica, v.8 n.4, p.373-402, December 2004
D. Manfaat , A. H. B. Duffy , B. S. Lee, SPIDA: Abstracting and generalizing layout design cases, Artificial Intelligence for Engineering Design, Analysis and Manufacturing, v.12 n.2, p.141-159, April 1998
Shai Fine , Yishay Mansour, Active sampling for multiple output identification, Machine Learning, v.69 n.2-3, p.213-228, December 2007
Joonghyun Ryu , Rhohun Park , Deok-Soo Kim, Molecular surfaces on proteins via beta shapes, Computer-Aided Design, v.39 n.12, p.1042-1057, December, 2007
Yan Gerard , David Coeurjolly , Fabien Feschet, Gift-wrapping based preimage computation algorithm, Pattern Recognition, v.42 n.10, p.2255-2264, October, 2009
Vineet Sangar , Victor I. Lesk , Arthur M. Lesk, Brief Communication: On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions, Computational Biology and Chemistry, v.32 n.3, p.212-214, June, 2008
Smiljan Šinjur , Damjan Zazula, A novel approach to image matching using convex layers, Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision, p.226-230, August 21-23, 2006, Elounda, Greece
Jan Chomicki , Peter Z. Revesz, Constraint-based Interoperability of Spatiotemporal Databases*, Geoinformatica, v.3 n.3, p.211-243, September 1999
Martin Erwig , Ralf Hartmut Güting , Markus Schneider , Michalis Vazirgiannis, Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases, Geoinformatica, v.3 n.3, p.269-296, September 1999
Eric Goubault, Geometry and concurrency: a user's guide, Mathematical Structures in Computer Science, v.10 n.4, p.411-425, August 2000
Martin Raussen, On the classification of dipaths in geometric models for concurrency, Mathematical Structures in Computer Science, v.10 n.4, p.427-457, August 2000
Ali Akgunduz , Dan Zetu , Pat Banerjee, Viewpoint-based shape recovery from multiple views, Artificial Intelligence for Engineering Design, Analysis and Manufacturing, v.14 n.5, p.359-372, November 2000
Mark de Berg , Katrin Dobrindt, On levels of detail in terrains, Proceedings of the eleventh annual symposium on Computational geometry, p.426-427, June 05-07, 1995, Vancouver, British Columbia, Canada
Robert J. Renka, Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere, ACM Transactions on Mathematical Software (TOMS), v.23 n.3, p.416-434, Sept. 1997
Henrik Weimer , Joe Warren , Jane Troutner , Wendell Wiggins , John Shrout, Efficient co-triangulation of large data sets, Proceedings of the conference on Visualization '98, p.119-126, October 18-23, 1998, Research Triangle Park, North Carolina, United States
Prosenjit Bose , Pat Morin , Ivan Stojmenović , Jorge Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, p.48-55, August 20-20, 1999, Seattle, Washington, United States
H. Edelsbrunner , E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, Proceedings of the fourth annual symposium on Computational geometry, p.118-133, June 06-08, 1988, Urbana-Champaign, Illinois, United States
Michael T. Goodrich, Applying parallel processing techniques to classification problems in constructive solid geometry, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.118-128, January 22-24, 1990, San Francisco, California, United States
Pankaj K. Agarwal , Boris Aronov , Micha Sharir , Subhash Suri, Selecting distances in the plane, Proceedings of the sixth annual symposium on Computational geometry, p.321-331, June 07-09, 1990, Berkley, California, United States
Timothy M. Chan, Three problems about simple polygons, Computational Geometry: Theory and Applications, v.35 n.3, p.209-217, October 2006
Paul Morrison , Ju Jia Zou, Skeletonization based on error reduction, Pattern Recognition, v.39 n.6, p.1099-1109, June, 2006
C. Gope , N. Kehtarnavaz, Affine invariant comparison of point-sets using convex hulls and hausdorff distances, Pattern Recognition, v.40 n.1, p.309-320, January, 2007
Mark de Berg , Dan Halperin , Mark Overmars, An intersection-sensitive algorithm for snap rounding, Computational Geometry: Theory and Applications, v.36 n.3, p.159-165, April, 2007
Peyman Afshani , Timothy M. Chan, On approximate range counting and depth, Proceedings of the twenty-third annual symposium on Computational geometry, June 06-08, 2007, Gyeongju, South Korea
Jeffrey Xu Yu , Weining Qian , Hongjun Lu , Aoying Zhou, Finding centric local outliers in categorical/numerical spaces, Knowledge and Information Systems, v.9 n.3, p.309-338, March 2006
Mainak Chatterjee , Sajal K. Das, Vector quantization based QoS classification for admission control in CDMA systems, Wireless Networks, v.11 n.6, p.709-718, November 2005
Sylvain Ferrandiz , Marc Boullé, Supervised evaluation of Voronoi partitions, Intelligent Data Analysis, v.10 n.3, p.269-283, January 2006
Ladislav Kavan , Ivana Kolingerova , Jiri Zara, Fast approximation of convex hull, Proceedings of the 2nd IASTED international conference on Advances in computer science and technology, p.101-104, January 23-25, 2006, Puerto Vallarta, Mexico
Hyunjin Shin , Mia K. Markey, A machine learning perspective on the development of clinical decision support systems utilizing mass spectra of blood samples, Journal of Biomedical Informatics, v.39 n.2, p.227-248, April 2006
Chris Drummond , Robert C. Holte, Cost curves: An improved method for visualizing classifier performance, Machine Learning, v.65 n.1, p.95-130, October 2006
Ruo-Wei Hung , Maw-Shang Chang, Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, Theoretical Computer Science, v.341 n.1, p.411-440, 5 September 2005
Nick Koudas , Chen Li , Anthony K. H. Tung , Rares Vernica, Relaxing join and selection queries, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
Nisheeth Shrivastava , Subhash Suri , Csaba D. Tóth, Detecting cuts in sensor networks, Proceedings of the 4th international symposium on Information processing in sensor networks, April 24-27, 2005, Los Angeles, California
Asish Mukhopadhyay , Samidh Chatterjee , Benjamin Lafreniere, On the all-farthest-segments problem for a planar set of points, Information Processing Letters, v.100 n.3, p.120-123, 15 November 2006
Ilaria Bartolini , Paolo Ciaccia , Marco Patella, SaLSa: computing the skyline without scanning the whole sky, Proceedings of the 15th ACM international conference on Information and knowledge management, November 06-11, 2006, Arlington, Virginia, USA
Rashid Bin Muhmmad, Parallelization of local search for Euclidean Steiner tree problem, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida
Xiaobin Ma , Shashi Shekhar , Hui Xiong , Pusheng Zhang, Exploiting a page-level upper bound for multi-type nearest neighbor queries, Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems, November 10-11, 2006, Arlington, Virginia, USA
Jun-yong Noh , Ulrich Neumann, Expression cloning, ACM SIGGRAPH 2006 Courses, July 30-August 03, 2006, Boston, Massachusetts
Yen-Liang Chen , Jen-Ming Chen , Ching-Wen Tung, A data mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales, Decision Support Systems, v.42 n.3, p.1503-1520, December 2006
Prosenjit Bose , Anil Maheshwari , Pat Morin , Jason Morrison , Michiel Smid , Jan Vahrenhold, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory and Applications, v.37 n.3, p.209-227, August, 2007
Ivayio Ilinkin , Ravi Janardan , Michiel Smid , Eric Johnson , Paul Castillo , Jörg Schwerdt, Heuristics for estimating contact area of supports in layered manufacturing, Journal of Experimental Algorithmics (JEA), 11, 2006
Jason Matthews , Baljinder Singh , Glen Mullineux , Tony Medland, Constraint-based approach to investigate the process flexibility of food processing equipment, Computers and Industrial Engineering, v.51 n.4, p.809-820, December, 2006
Marco Lanzagorta , Jeffrey K. Uhlmann, Hybrid quantum-classical computing with applications to computer graphics, ACM SIGGRAPH 2005 Courses, July 31-August 04, 2005, Los Angeles, California
Alan P. Sprague, O(1) query time algorithm for all pairs shortest distances on permutation graphs, Discrete Applied Mathematics, v.155 n.3, p.365-373, February, 2007
Iddo Hanniel , Ron Wein, An exact, complete and efficient computation of arrangements of Bézier curves, Proceedings of the 2007 ACM symposium on Solid and physical modeling, June 04-06, 2007, Beijing, China
Jon Feldman , S Muthukrishnan , Martin Pal , Cliff Stein, Budget optimization in search-based advertising auctions, Proceedings of the 8th ACM conference on Electronic commerce, June 11-15, 2007, San Diego, California, USA
Zhenglu Yang , Botao Wang , Masaru Kitsuregawa, General dominant relationship analysis based on partial order models, Proceedings of the 2007 ACM symposium on Applied computing, March 11-15, 2007, Seoul, Korea
Lilian Buzer, A simple algorithm for digital line recognition in the general case, Pattern Recognition, v.40 n.6, p.1675-1684, June, 2007
Marc Geilen , Twan Basten, A calculator for Pareto points, Proceedings of the conference on Design, automation and test in Europe, April 16-20, 2007, Nice, France
M. Spada , M. Bierlaire , Th. M. Liebling, Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem, Transportation Science, v.39 n.4, p.477-490, November 2005
Wenye Li , Kin-Hong Lee , Kwong-Sak Leung, Large-scale RLSC learning without agony, Proceedings of the 24th international conference on Machine learning, p.529-536, June 20-24, 2007, Corvalis, Oregon
Valentin Brimkov , David Coeurjolly , Reinhard Klette, Digital planarity-A review, Discrete Applied Mathematics, v.155 n.4, p.468-495, February, 2007
Tetsushi Nishida , Kokichi Sugihara , Masato Kimura, Stable marker-particle method for the Voronoi diagram in a flow field, Journal of Computational and Applied Mathematics, v.202 n.2, p.377-391, May, 2007
Edwin H. Jacox , Hanan Samet, Spatial join techniques, ACM Transactions on Database Systems (TODS), v.32 n.1, p.7-es, March 2007
Valentin E. Brimkov , Stefan Dantchev, Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model, Image and Vision Computing, v.25 n.10, p.1631-1643, October, 2007
Juan K. Lin , David G. Grier , Jack D. Cowan, Faithful representation of separable distributions, Neural Computation, v.9 n.6, p.1305-1320, Aug. 15, 1997
Ricard Gavaldà , Hava T. Siegelmann, Discontinuities in recurrent neural networks, Neural Computation, v.11 n.3, p.715-745, April 1, 1999
Ron Wein, Exact and approximate construction of offset polygons, Computer-Aided Design, v.39 n.6, p.518-527, June, 2007
Siu-Wing Cheng , Hyeon-Suk Na , Antoine Vigneron , Yajun Wang, Approximate shortest paths in anisotropic regions, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.766-774, January 07-09, 2007, New Orleans, Louisiana
Erkan Besdok, Impulsive noise suppression from images by using Anfis interpolant and lillietest, EURASIP Journal on Applied Signal Processing, v.2004 n.1, p.2423-2433, 1 January 2004
Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor , Peter Widmayer, Progressive merge join: a generic and non-blocking sort-based join algorithm, Proceedings of the 28th international conference on Very Large Data Bases, p.299-310, August 20-23, 2002, Hong Kong, China
Donald Kossmann , Frank Ramsak , Steffen Rost, Shooting stars in the sky: an online algorithm for skyline queries, Proceedings of the 28th international conference on Very Large Data Bases, p.275-286, August 20-23, 2002, Hong Kong, China
Antonio G. N. Novaes , J. E. Souza de Cursi , Arinei C. L. da Silva , João C. Souza, Solving continuous location-districting problems with Voronoi diagrams, Computers and Operations Research, v.36 n.1, p.40-59, January, 2009
Xianming Chen , Richard F. Riesenfeld , Elaine Cohen , James Damon, Theoretically-based algorithms for robustly tracking intersection curves of deforming surfaces, Computer-Aided Design, v.39 n.5, p.389-397, May, 2007
Timothy M. Chan , Mihai Pǎtraşcu, Voronoi diagrams in n · 2o(√lg lg n) time, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
Timothy M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
Mika Murtojärvi , Tapio Suominen , Harri Tolvanen , Ville Leppänen , Olli S. Nevalainen, Quantifying distances from points to polygons-applications in determining fetch in coastal environments, Computers & Geosciences, v.33 n.7, p.843-852, July, 2007
Joel Fenwick , V. Estivill-Castro, Mutually visible agents in a discrete environment, Proceedings of the thirtieth Australasian conference on Computer science, p.141-150, January 30-February 02, 2007, Ballarat, Victoria, Australia
Adam N. Letchford , Nicholas A. Pearson, Good triangulations yield good tours, Computers and Operations Research, v.35 n.2, p.638-647, February, 2008
Glen MacLarty , Michael Fry, Towards a platform for wide-area overlay network deployment and management, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.8, p.2144-2162, June, 2007
Manoranjan Dash , Simona Petrutiu , Peter Scheuermann, pPOP: Fast yet accurate parallel hierarchical clustering using partitioning, Data & Knowledge Engineering, v.61 n.3, p.563-578, June, 2007
M. Morse , J. M. Patel , W. I. Grosky, Efficient continuous skyline computation, Information Sciences: an International Journal, v.177 n.17, p.3411-3437, September, 2007
Cuiping Li , Anthony K. H. Tung , Wen Jin , Martin Ester, On dominating your neighborhood profitably, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
Hamid Zarrabi-Zadeh, Flying over a polyhedral terrain, Information Processing Letters, v.105 n.3, p.103-107, January, 2008
G. Scheithauer , Yu. G. Stoyan , T. Ye. Romanova, Mathematical Modeling of Interactions of Primary Geometric 3D Objects, Cybernetics and Systems Analysis, v.41 n.3, p.332-342, May 2005
Joachim Gudmundsson , Christos Levcopoulos , Giri Narasimhan , Michiel Smid, Approximate distance oracles for geometric spanners, ACM Transactions on Algorithms (TALG), v.4 n.1, p.1-34, March 2008
Ting Liu , Andrew W. Moore , Alexander Gray, New Algorithms for Efficient High-Dimensional Nonparametric Classification, The Journal of Machine Learning Research, 7, p.1135-1158, 12/1/2006
Tian Xia , Donghui Zhang, Refreshing the sky: the compressed skycube with efficient support for frequent updates, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
Chee-Yong Chan , H. V. Jagadish , Kian-Lee Tan , Anthony K. H. Tung , Zhenjie Zhang, Finding k-dominant skylines in high dimensional space, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
Edwin M. Knorr , Raymond T. Ng , Vladimir Tucakov, Distance-based outliers: algorithms and applications, The VLDB Journal — The International Journal on Very Large Data Bases, v.8 n.3-4, p.237-253, February 2000
Marc van Kreveld , René van Oostrum , Chandrajit Bajaj , Valerio Pascucci , Dan Schikore, Contour trees and small seed sets for isosurface traversal, Proceedings of the thirteenth annual symposium on Computational geometry, p.212-220, June 04-06, 1997, Nice, France
Rimantas Benetis , S. Jensen , Gytis Karĉiauskas , Simonas Ŝaltenis, Nearest and reverse nearest neighbor queries for moving objects, The VLDB Journal — The International Journal on Very Large Data Bases, v.15 n.3, p.229-249, September 2006
Peter Veelaert, Geometric Constructions in the Digital Plane, Journal of Mathematical Imaging and Vision, v.11 n.2, p.99-118, Oct. 1999
Hüuseyin Kutluca , Tah&suml;in M. Kurç , Cevdet Aykanat, Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids, The Journal of Supercomputing, v.15 n.1, p.51-93, Jan. 2000
Howie Choset, Coverage of Known Spaces: The Boustrophedon Cellular Decomposition, Autonomous Robots, v.9 n.3, p.247-253, December 2000
Hatem Hamda , François Jouve , Evelyne Lutton , Marc Schoenauer , MichÈle Sebag, Compact Unstructured Representations for Evolutionary Design, Applied Intelligence, v.16 n.2, p.139-155, March-April 2002
J. Lang , M. R. M. Jenkin, Active Object Modeling with VIRTUE, Autonomous Robots, v.8 n.2, p.141-159, April 2000
V. J. Lumelsky , K. R. Harinarayan, Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model, Autonomous Robots, v.4 n.1, p.121-135, March 1997
Emre Salman , Eby G. Friedman , Ali Dasdan , Feroze Taraporevala , Kayhan Kucukcakar, Pessimism Reduction In Static Timing Analysis Using Interdependent Setup and Hold Times, Proceedings of the 7th International Symposium on Quality Electronic Design, p.159-164, March 27-29, 2006
Ioannis Rekleitis , Gregory Dudek , Evangelos Milios, Multi-robot collaboration for robust exploration, Annals of Mathematics and Artificial Intelligence, v.31 n.1-4, p.7-40, 2001
Howie Choset, Coverage for robotics – A survey of recent results, Annals of Mathematics and Artificial Intelligence, v.31 n.1-4, p.113-126, 2001
Alexandros Nanopoulos , Yannis Theodoridis , Yannis Manolopoulos, C2P: Clustering based on Closest Pairs, Proceedings of the 27th International Conference on Very Large Data Bases, p.331-340, September 11-14, 2001
R. H. Güting, Gral: an extensible relational database system for geometric applications, Proceedings of the 15th international conference on Very large data bases, p.33-44, July 1989, Amsterdam, The Netherlands
Maurìcio R. Mediano , Marco A. Casanova , Marcelo Dreux, V-Trees - A Storage Method for Long Vector Data, Proceedings of the 20th International Conference on Very Large Data Bases, p.321-330, September 12-15, 1994
Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter, Scalable Sweeping-Based Spatial Join, Proceedings of the 24rd International Conference on Very Large Data Bases, p.570-581, August 24-27, 1998
Yasuhiko Morimoto , Takeshi Fukuda , Hirofumi Matsuzawa , Takeshi Tokuyama , Kunikazu Yoda, Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases, Proceedings of the 24rd International Conference on Very Large Data Bases, p.380-391, August 24-27, 1998
Edwin M. Knorr , Raymond T. Ng, Algorithms for Mining Distance-Based Outliers in Large Datasets, Proceedings of the 24rd International Conference on Very Large Data Bases, p.392-403, August 24-27, 1998
Ilaria Bartolini , Paolo Ciaccia , Florian Waas, FeedbackBypass: A New Approach to Interactive Similarity Query Processing, Proceedings of the 27th International Conference on Very Large Data Bases, p.201-210, September 11-14, 2001
Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer, A Generic Approach to Bulk Loading Multidimensional Index Structures, Proceedings of the 23rd International Conference on Very Large Data Bases, p.406-415, August 25-29, 1997
Hans-Peter Kriegel , Marco Pötke , Thomas Seidl, Managing Intervals Efficiently in Object-Relational Databases, Proceedings of the 26th International Conference on Very Large Data Bases, p.407-418, September 10-14, 2000
Kian-Lee Tan , Pin-Kwang Eng , Beng Chin Ooi, Efficient Progressive Skyline Computation, Proceedings of the 27th International Conference on Very Large Data Bases, p.301-310, September 11-14, 2001
Alexander Brodsky , Joxan Jaffar , Michael J. Maher, Toward Practical Constraint Databases, Proceedings of the 19th International Conference on Very Large Data Bases, p.567-580, August 24-27, 1993
Oliver Günther , Eugene Wong, A Dual Space Representation for Geometric Data, Proceedings of the 13th International Conference on Very Large Data Bases, p.501-506, September 01-04, 1987
Timos K. Sellis , Nick Roussopoulos , Christos Faloutsos, The R+-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th International Conference on Very Large Data Bases, p.507-518, September 01-04, 1987
Donghui Zhang , J. Tsotras, Optimizing spatial Min/Max aggregations, The VLDB Journal — The International Journal on Very Large Data Bases, v.14 n.2, p.170-181, April 2005
Andreas C. Nearchou , Nikos A. Aspragathos, A genetic path planning algorithm for redundant articulated robots, Robotica, v.15 n.2, p.213-224, March 1997
William J. Schroeder , Berk Geveci , Mathieu Malaterre, Compatible Triangulations of Spatial Decompositions, Proceedings of the conference on Visualization '04, p.211-218, October 10-15, 2004
Guanglu Zhou , Kim-Chuan Tohemail , Jie Sun, Efficient Algorithms for the Smallest Enclosing Ball Problem, Computational Optimization and Applications, v.30 n.2, p.147-160, February 2005
B. Kapoor, An efficient method for computing exact path delay fault coverage, Proceedings of the 1995 European conference on Design and Test, p.516, March 06-09, 1995
Yuri M. Bayakovsky, Russia: computer graphics education takes off in the 1990s, ACM SIGGRAPH Computer Graphics, v.30 n.3, p.21-22, Aug. 1996
Jun Yang , Jennifer Widom, Incremental computation and maintenance of temporal aggregates, The VLDB Journal — The International Journal on Very Large Data Bases, v.12 n.3, p.262-283, October 2003
S. I. Yaremchuk , Yu. A. Shapovalov, Minimax optimal placement problem for special-form objects on a multiply connected domain, Cybernetics and Systems Analysis, v.43 n.3, p.419-426, May 2007
Ricardo A. Baeza-Yates, Teaching algorithms, ACM SIGACT News, v.26 n.4, p.51-59, Dec. 1995
G. G. Zabudskii, A Minimax Planar Location Problem with Forbidden Zones: Its Solution Algorithm, Automation and Remote Control, v.65 n.2, p.241-247, February 2004
Waldir L. Roque , Dionísio Doering, Trajectory planning for lab robots based on global vision and Voronoi roadmaps, Robotica, v.23 n.4, p.467-477, July 2005
Alexander Brodsky, Constraint Databases: Promising Technology or Just IntellectualExercise?, Constraints, v.2 n.1, p.35-44, April 1997
Thomas Kämpke, Convex Translation Estimation, Journal of Intelligent and Robotic Systems, v.21 n.3, p.287-300, March 1998
Emilio Carrizosa , Frank Plastria, Dominators for Multiple-objective Quasiconvex Maximization Problems, Journal of Global Optimization, v.18 n.1, p.35-58, September 2000
Nelson Max , Pat Hanrahan , Roger Crawfis, Area and volume coherence for efficient visualization of 3D scalar functions, ACM SIGGRAPH Computer Graphics, v.24 n.5, p.27-33, Nov. 1990
James E. Falk , Emma Lopez-Cardona, The Surgical Separation of Sets, Journal of Global Optimization, v.11 n.4, p.433-462, December 1997
Michela Bertolotto , Max J. Egenhofer, Progressive Transmission of Vector Map Data over the World Wide Web, Geoinformatica, v.5 n.4, p.345-373, December 2001
Pang Chen, On Intelligent Robot Motion Planning via Learning, Journal of Intelligent and Robotic Systems, v.19 n.3, p.299-320, July 1997
Jose Antonio Cotelo Lema , Ralf Hartmut Güting, Dual Grid: A New Approach for Robust Spatial Algebra Implementation, Geoinformatica, v.6 n.1, p.57-76, March 2002
Daniel Lopresti , Jiangying Zhou, Locating and Recognizing Text in WWW Images, Information Retrieval, v.2 n.2-3, p.177-206, May 2000
Binhai Zhu, Fast Range Searching with Delaunay Triangulations, Geoinformatica, v.4 n.3, p.317-334, October 2000
Thomas Kämpke , Matthias Strobel, Polygonal Model Fitting, Journal of Intelligent and Robotic Systems, v.30 n.3, p.279-310, March 2001
Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta, Radial drawings of graphs: Geometric constraints and trade-offs, Journal of Discrete Algorithms, v.6 n.1, p.109-124, March, 2008
Sylvie Servigne , Thierry Ubeda , Alain Puricelli , Robert Laurini, A Methodology for Spatial Consistency Improvement of Geographic Databases, Geoinformatica, v.4 n.1, p.7-34, March 2000
Takahito Kuno , Yoshitsugu Yamamoto, A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs, Journal of Global Optimization, v.12 n.3, p.247-265, April 1998
Yong-Ju Lee , Chin-Wan Chung, The DR-tree: A Main Memory Data Structure for Complex Multi-dimensional Objects, Geoinformatica, v.5 n.2, p.181-207, June 2001
Xiuzhen Cheng , Bhaskar Dasgupta , Bing Lu, Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem, Journal of Global Optimization, v.21 n.4, p.385-396, December 2001
Andreas Dolzmann , Thomas Sturm , Volker Weispfenning, A New Approach for Automatic Theorem Proving in Real Geometry, Journal of Automated Reasoning, v.21 n.3, p.357-380, December 1998
R. Tamassia , J. S. Vitter, Optimal parallel algorithms for transitive closure and point location in planar structures, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.399-408, June 18-21, 1989, Santa Fe, New Mexico, United States
M. T. Goodrich, Intersecting line segments in parallel with an output-sensitive number of processors, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.127-137, June 18-21, 1989, Santa Fe, New Mexico, United States
Hanli Zhao , Xiaogang Jin , Jianbing Shen , Shufang Lu, Fast and reliable mouse picking using graphics hardware, International Journal of Computer Games Technology, 2009, p.1-7, January 2009
Harish Gopala , Pat Morin, Algorithms for bivariate zonoid depth, Computational Geometry: Theory and Applications, v.39 n.1, p.2-13, January, 2008
Isabelle Bloch, Fuzzy skeleton by influence zones---Application to interpolation between fuzzy sets, Fuzzy Sets and Systems, v.159 n.15, p.1973-1990, August, 2008
Jeffrey Scott Vitter, Algorithms and data structures for external memory, Foundations and Trends® in Theoretical Computer Science, v.2 n.4, p.305-474, January 2008
Edwin H. Jacox , Hanan Samet, Metric space similarity joins, ACM Transactions on Database Systems (TODS), v.33 n.2, p.1-38, June 2008
Shuo-Yan Chou , Chang-Chien Chou , Yu-Kumg Chen, A base function for generating contour traversal paths in stereolithography apparatus applications, Expert Systems with Applications: An International Journal, v.35 n.1-2, p.235-244, July, 2008
Tetsuo Ida , Mircea Marin , Hidekazu Takahashi , Fadoua Ghoura, Computational Origami Construction as Constraint Solving and Rewriting, Electronic Notes in Theoretical Computer Science (ENTCS), 216, p.31-44, July, 2008
Donghui Zhang , Alexander Markowetz , Vassilis J. Tsotras , Dimitrios Gunopulos , Bernhard Seeger, On computing temporal aggregates with range predicates, ACM Transactions on Database Systems (TODS), v.33 n.2, p.1-39, June 2008
Ali Ahmadinia , Christophe Bobda , Sandor P. Fekete , Jurgen Teich , Jan C. van der Veen, Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices, IEEE Transactions on Computers, v.56 n.5, p.673-680, May 2007
Hanan Samet, A sorting approach to indexing spatial data, ACM SIGGRAPH 2008 classes, August 11-15, 2008, Los Angeles, California
Biing-Feng Wang , Tzu-Chin Lin , Chien-Hsin Lin , Shan-Chyun Ku, Finding the conditional location of a median path on a tree, Information and Computation, v.206 n.7, p.828-839, July, 2008
Patrick Baudisch , Alexander Zotov , Edward Cutrell , Ken Hinckley, Starburst: a target expansion algorithm for non-uniform target distributions, Proceedings of the working conference on Advanced visual interfaces, May 28-30, 2008, Napoli, Italy
D. S. Franzblau , G. Xenakis, An algorithm for the difference between set covers, Discrete Applied Mathematics, v.156 n.10, p.1623-1632, May, 2008
Magali I. Billen , Oliver Kreylos , Bernd Hamann , Margarete A. Jadamec , Louise H. Kellogg , Oliver Staadt , Dawn Y. Sumner, A geoscience perspective on immersive 3D gridded data visualization, Computers & Geosciences, v.34 n.9, p.1056-1072, September, 2008
Marc Mörig , Dieter Rautenbach , Michiel Smid , Jan Tusch, An Ω(n logn) lower bound for computing the sum of even-raked elements, Information Processing Letters, v.109 n.16, p.955-956, July, 2009
Jana Dietel , Hans-Dietrich Hecker , Andreas Spillner, A note on optimal floodlight illumination of stages, Information Processing Letters, v.105 n.4, p.121-123, February, 2008
T. D. Tang , Erik L. J. Bohez , Pisut Koomsap, The sweep plane algorithm for global collision detection with workpiece geometry update for five-axis NC machining, Computer-Aided Design, v.39 n.11, p.1012-1024, November, 2007
Goce Trajcevski , Hui Ding , Peter Scheuermann , Roberto Tamassia , Dennis Vaccaro, Dynamics-aware similarity of moving objects trajectories, Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems, November 07-09, 2007, Seattle, Washington
John Hershberger , Subhash Suri, Adaptive sampling for geometric problems over data streams, Computational Geometry: Theory and Applications, v.39 n.3, p.191-208, April, 2008
Mirko Zadravec , Andrej Brodnik , Markus Mannila , Merja Wanne , Borut alik, A practical approach to the 2D incremental nearest-point problem suitable for different point distributions, Pattern Recognition, v.41 n.2, p.646-653, February, 2008
Detlef Sieling, Minimization of decision trees is hard to approximate, Journal of Computer and System Sciences, v.74 n.3, p.394-403, May, 2008
Ruibin Xu , Daniel Mossé , Rami Melhem, Minimizing expected energy consumption in real-time systems through dynamic voltage scaling, ACM Transactions on Computer Systems (TOCS), v.25 n.4, p.9-es, December 2007
Sébastien Collette , Vida Dujmović , John Iacono , Stefan Langerman , Pat Morin, Distribution-sensitive point location in convex subdivisions, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.912-921, January 20-22, 2008, San Francisco, California
Jing Li , Wencheng Wang , Enhua Wu, Technical Section: Point-in-polygon tests by convex decomposition, Computers and Graphics, v.31 n.4, p.636-648, August, 2007
Andrzej Lingas , Agnieszka Wasylewicz , Paweł Żyliński, Note on covering monotone orthogonal polygons with star-shaped polygons, Information Processing Letters, v.104 n.6, p.220-227, December, 2007
Timothy M. Chan , Eric Y. Chen, In-place 2-d nearest neighbor search, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.904-911, January 20-22, 2008, San Francisco, California
Sergey Bereg , J. Miguel Díaz-Báòez , Carlos Seara , Inmaculada Ventura, On finding widest empty curved corridors, Computational Geometry: Theory and Applications, v.38 n.3, p.154-169, October, 2007
Sergio Cabello , J. Miguel Díaz-Báòez , Carlos Seara , J. Antoni Sellarès , Jorge Urrutia , Inmaculada Ventura, Covering point sets with two disjoint disks or squares, Computational Geometry: Theory and Applications, v.40 n.3, p.195-206, August, 2008
Maurizio Patrignani, Complexity results for three-dimensional orthogonal graph drawing, Journal of Discrete Algorithms, v.6 n.1, p.140-161, March, 2008
Yuh-Rau Wang, An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective, Journal of Parallel and Distributed Computing, v.67 n.10, p.1082-1091, October, 2007
Michael Arock , R. Ponalagusamy, Parallel algorithms for robot path planning with simpler VLSI architecture, International Journal of Computer Applications in Technology, v.26 n.3, p.157-163, August 2006
Michela Bertolotto , Min Zhou, Efficient and consistent line simplification for web mapping, International Journal of Web Engineering and Technology, v.3 n.2, p.139-156, January 2007
David L. Maulsby , Ian H. Witten , Kenneth A. Kittlitz , Valerio G. Franceschin, Inferring graphical procedures: the compleat metarnouse, Human-Computer Interaction, v.7 n.1, p.47-89, March 1992
D. Satyanarayana , S. V. Rao, Constrained Delaunay triangulation for ad hoc networks, Journal of Computer Systems, Networks, and Communications, 2008, p.1-10, January 2008
Kun Zhou , Qiming Hou , Rui Wang , Baining Guo, Real-time KD-tree construction on graphics hardware, ACM Transactions on Graphics (TOG), v.27 n.5, December 2008
Dimitri Marinakis , Gregory Dudek, Self-calibration of a vision-based sensor network, Image and Vision Computing, v.27 n.1-2, p.116-130, January, 2009
Arindam Karmakar , Sasanka Roy , Sandip Das, Fast computation of smallest enclosing circle with center on a query line segment, Information Processing Letters, v.108 n.6, p.343-346, November, 2008
David Coeurjolly , Annick Montanvert, Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.29 n.3, p.437-448, March 2007
Seok-Hee Hong , Hiroshi Nagamochi, Convex drawings of graphs with non-convex boundary constraints, Discrete Applied Mathematics, v.156 n.12, p.2368-2380, June, 2008
Andy An-Kai Jeng , Rong-Hong Jan, The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks, IEEE Transactions on Parallel and Distributed Systems, v.18 n.4, p.536-549, April 2007
Esther M. Arkin , Joseph S. B. Mitchell , Jack Snoeyink, Capturing crossings: Convex hulls of segment and plane intersections, Information Processing Letters, v.107 n.5, p.194-197, August, 2008
David Bremner , Dan Chen , John Iacono , Stefan Langerman , Pat Morin, Output-sensitive algorithms for Tukey depth and related problems, Statistics and Computing, v.18 n.3, p.259-266, September 2008
Yong-Hsiang Hsieh , Chih-Chiang Yu , Biing-Feng Wang, Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.5 n.2, p.281-290, April 2008
Jie Lian , Kshirasagar Naik, Skipping technique in face routing for wireless ad hoc and sensor networks, International Journal of Sensor Networks, v.4 n.1/2, p.92-103, July 2008
Elias k. Xidias , Nikos a. Aspragathos, Motion planning for multiple non-holonomic robots: A geometric approach, Robotica, v.26 n.4, p.525-536, July 2008
Sudipto Guha , Kyuseok Shim, A Note on Linear Time Algorithms for Maximum Error Histograms, IEEE Transactions on Knowledge and Data Engineering, v.19 n.7, p.993-997, July 2007
Valentin E. Brimkov , Reneta P. Barneva, On the polyhedral complexity of the integer points in a hyperball, Theoretical Computer Science, v.406 n.1-2, p.24-30, October, 2008
Leland Wilkinson , Anushka Anand , Robert Grossman, High-Dimensional Visual Analytics: Interactive Exploration Guided by Pairwise Views of Point Distributions, IEEE Transactions on Visualization and Computer Graphics, v.12 n.6, p.1363-1372, November 2006
Ashwin Machanavajjhala , Erik Vee , Minos Garofalakis , Jayavel Shanmugasundaram, Scalable ranked publish/subscribe, Proceedings of the VLDB Endowment, v.1 n.1, August 2008
Edwin R. van Dam, Two-dimensional minimax Latin hypercube designs, Discrete Applied Mathematics, v.156 n.18, p.3483-3493, November, 2008
Alexander Tiskin, Semi-local longest common subsequences in subquadratic time, Journal of Discrete Algorithms, v.6 n.4, p.570-581, December, 2008
Wojciech Jarosz , Henrik Wann Jensen , Craig Donner, Advanced global illumination using photon mapping, ACM SIGGRAPH 2008 classes, August 11-15, 2008, Los Angeles, California
M. E. Gegúndez , J. Aroba , J. M. Bravo, Identification of piecewise affine systems by means of fuzzy clustering and competitive learning, Engineering Applications of Artificial Intelligence, v.21 n.8, p.1321-1329, December, 2008
Nir Goldschmidt , Dan Gordon, The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing, Computational Geometry: Theory and Applications, v.41 n.3, p.167-187, November, 2008
Ruy Ley-Wild , Matthew Fluet , Umut A. Acar, Compiling self-adjusting programs with continuations, ACM SIGPLAN Notices, v.43 n.9, September 2008
Sergey Bereg , Nikolaus Mutsanas , Alexander Wolff, Matching points with rectangles and squares, Computational Geometry: Theory and Applications, v.42 n.2, p.93-108, February, 2009
Yusu Wang, Approximating nearest neighbor among triangles in convex position, Information Processing Letters, v.108 n.6, p.379-385, November, 2008
Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta , Henk Meijer , Stephen K. Wismath, Point-set embeddings of trees with given partial drawings, Computational Geometry: Theory and Applications, v.42 n.6-7, p.664-676, August, 2009
Martin Ziegler , Wouter M. Koolen, Kolmogorov Complexity Theory over the Reals, Electronic Notes in Theoretical Computer Science (ENTCS), 221, p.153-169, December, 2008
Ilaria Bartolini , Paolo Ciaccia , Marco Patella, Efficient sort-based skyline evaluation, ACM Transactions on Database Systems (TODS), v.33 n.4, p.1-49, November 2008
Douglass Stott Parker , Ruey-Lung Hsiao , Yi Xing , Alissa M. Resch , Christopher J. Lee, Solving the Problem of Trans-Genomic Query with Alignment Tables, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.5 n.3, p.432-447, July 2008
Minho Chang , Sang C. Park, Automated scanning of dental impressions, Computer-Aided Design, v.41 n.6, p.404-411, June, 2009
Dimitrios Skoutas , Dimitris Sacharidis , Alkis Simitsis , Verena Kantere , Timos Sellis, Top-k dominant web services under multi-criteria matching, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
Peyman Afshani , Timothy M. Chan, Optimal halfspace range reporting in three dimensions, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.180-186, January 04-06, 2009, New York, New York
Jean-Charles Créput , Abderrafiãa Koukam, A memetic neural network for the Euclidean traveling salesman problem, Neurocomputing, v.72 n.4-6, p.1250-1264, January, 2009
A. J. Medland , J. Matthews , G. Mullineux, A constraint-net approach to the resolution of conflicts in a product with multi-technology requirements, International Journal of Computer Integrated Manufacturing, v.22 n.3, p.199-209, March 2009
David Fuhry , Ruoming Jin , Donghui Zhang, Efficient skyline computation in metric space, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
Tomasz Martyn, Chaos and Graphics: The attractor-wrapping approach to approximating convex hulls of 2D affine IFS attractors, Computers and Graphics, v.33 n.1, p.104-112, February, 2009
Hojjat Jafarpour , Bijit Hore , Sharad Mehrotra , Nalini Venkatasubramanian, Subscription subsumption evaluation for content-based publish/subscribe systems, Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware, December 01-05, 2008, Leuven, Belgium
Minghui Jiang , Joel Gillespie, Engineering the divide-and-conquer closest pair algorithm, Journal of Computer Science and Technology, v.22 n.4, p.532-540, July 2007
Minho Chang , Chong Man Kim , Sang C. Park, Tool-path generation for sidewall machining, Computers and Industrial Engineering, v.56 n.4, p.1649-1656, May, 2009
Reasey Praing , Markus Schneider, Topological feature vectors for exploring topological relationships, International Journal of Geographical Information Science, v.23 n.3, p.319-353, March 2009
Antoine Vacavant , David Coeurjolly , Laure Tougne, A framework for dynamic implicit curve approximation by an irregular discrete approach, Graphical Models, v.71 n.3, p.113-124, May, 2009
Steven Skiena, Computational geometry, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
Pavan Vatturi , Weng-Keen Wong, Category detection using hierarchical mean shift, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, June 28-July 01, 2009, Paris, France
Khaled R. Heloue , Sari Onaissi , Farid N. Najm, Efficient block-based parameterized timing analysis covering all potentially critical paths, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, November 10-13, 2008, San Jose, California
Motasem Aldiab , Emi Garcia-Palacios , Danny Crookes , Sakir Sezer, Packet classification by multilevel cutting of the classification space: an algorithmic-architectural solution for IP packet classification in next generation networks, Journal of Computer Systems, Networks, and Communications, 2008, p.1-14, January 2008
Alexandre Faure , Lilian Buzer , Fabien Feschet, Tangential cover for thick digital curves, Pattern Recognition, v.42 n.10, p.2279-2287, October, 2009
Rossen Atanassov , Prosenjit Bose , Mathieu Couture , Anil Maheshwari , Pat Morin , Michel Paquette , Michiel Smid , Stefanie Wuhrer, Algorithms for optimal outlier removal, Journal of Discrete Algorithms, v.7 n.2, p.239-248, June, 2009
Takashi Imamichi , Hiroshi Nagamochi, Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91-A n.9, p.2308-2313, September 2008
Chin-Chen Chang , Yung-Chen Chou , Chih-Yang Lin, Reversible Data Hiding in the VQ-Compressed Domain, IEICE - Transactions on Information and Systems, v.E90-D n.9, p.1422-1429, September 2007
Sasanka Roy , Arindam Karmakar , Sandip Das , Subhas C. Nandy, Constrained minimum enclosing circle with center on a query line segment, Computational Geometry: Theory and Applications, v.42 n.6-7, p.632-638, August, 2009
Jonatha Anselmi, A new framework supporting the bottleneck analysis of multiclass queueing networks, Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, October 20-24, 2008, Athens, Greece
Peyman Afshani , Chris Hamilton , Norbert Zeh, A general approach for cache-oblivious range reporting and approximate range counting, Proceedings of the 25th annual symposium on Computational geometry, June 08-10, 2009, Aarhus, Denmark
Francisco Martínez , Antonio Jesús Rueda , Francisco Ramón Feito, A new algorithm for computing Boolean operations on polygons, Computers & Geosciences, v.35 n.6, p.1177-1185, June, 2009
Valentin E. Brimkov, Digitization scheme that assures faithful reconstruction of plane figures, Pattern Recognition, v.42 n.8, p.1637-1649, August, 2009
Mika MurtojArvi , Ville LeppAnen , Olli S. Nevalainen, Determining directional distances between points and shorelines using sweep line technique, International Journal of Geographical Information Science, v.23 n.3, p.355-368, March 2009
Rashid Bin Muhammad, Range assignment problem on the Steiner tree based topology in ad hoc wireless networks, Mobile Information Systems, v.5 n.1, p.53-64, January 2009
Mikhail J. Atallah , Yinian Qi, Computing all skyline probabilities for uncertain data, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 29-July 01, 2009, Providence, Rhode Island, USA
Sang Won Bae , Chunseok Lee , Hee-Kap Ahn , Sunghee Choi , Kyung-Yong Chwa, Computing minimum-area rectilinear convex hull and L-shape, Computational Geometry: Theory and Applications, v.42 n.9, p.903-912, November, 2009
Robert Bembenik , Henryk Rybiński, FARICS: a method of mining spatial association rules and collocations using clustering and Delaunay diagrams, Journal of Intelligent Information Systems, v.33 n.1, p.41-64, August 2009
M. Fatih Demirci , Bram Platel , Ali Shokoufandeh , Luc L. Florack , Sven J. Dickinson, The Representation and Matching of Images Using Top Points, Journal of Mathematical Imaging and Vision, v.35 n.2, p.103-116, October 2009
Juan Cao , Xin Li , Guozhao Wang , Hong Qin, Technical Section: Surface reconstruction using bivariate simplex splines on Delaunay configurations, Computers and Graphics, v.33 n.3, p.341-350, June, 2009
Franco Scarselli , Marco Gori , Ah Chung Tsoi , Markus Hagenbuchner , Gabriele Monfardini, Computational capabilities of graph neural networks, IEEE Transactions on Neural Networks, v.20 n.1, p.81-102, January 2009
Spiros Skiadopoulos , Christos Giannoukos , Nikos Sarkas , Panos Vassiliadis , Timos Sellis , Manolis Koubarakis, Computing and Managing Cardinal Direction Relations, IEEE Transactions on Knowledge and Data Engineering, v.17 n.12, p.1610-1623, December 2005
Long Lin , Chee K. Yap, Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach, Proceedings of the 25th annual symposium on Computational geometry, June 08-10, 2009, Aarhus, Denmark
Timothy M. Chan , Eric Y. Chen, Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection, Proceedings of the 25th annual symposium on Computational geometry, June 08-10, 2009, Aarhus, Denmark
Ioannis M. Rekleitis , Gregory Dudek , Evangelos E. Milios, Multi-robot exploration of an unknown environment, efficiently reducing the odometry error, Proceedings of the Fifteenth international joint conference on Artifical intelligence, p.1340-1345, August 23-29, 1997, Nagoya, Japan
Bing Liu , Liang-Ping Ku , Wynne Hsu, Discovering interesting holes in data, Proceedings of the Fifteenth international joint conference on Artifical intelligence, p.930-935, August 23-29, 1997, Nagoya, Japan
Richard H. Stottler , Andrea L. Henke , James A. King, Rapid retrieval algorithms for case-based reasoning, Proceedings of the 11th international joint conference on Artificial intelligence, p.233-237, August 20-25, 1989, Detroit, Michigan
Bo Zhang , Ling Zhang , Tian Zhang, Motion planning of multi-joint robotic arm with topological dimension reduction method, Proceedings of the 11th international joint conference on Artificial intelligence, p.1029-1034, August 20-25, 1989, Detroit, Michigan
Pankaj Mehra , Larry A. Rendell , Benjamin W. Wah, Principled constructive induction, Proceedings of the 11th international joint conference on Artificial intelligence, p.651-656, August 20-25, 1989, Detroit, Michigan
Zhenglu Yang , Lin Li , Masaru Kitsuregawa, Efficient querying relaxed dominant relationship between product items based on rank aggregation, Proceedings of the 23rd national conference on Artificial intelligence, p.1261-1266, July 13-17, 2008, Chicago, Illinois
Olivier D. Faugeras, Artificial 3D vision, Proceedings of the 10th international joint conference on Artificial intelligence, p.1169-1171, August 23-28, 1987, Milan, Italy
Nikos Mamoulis , Dimitris Papadias, Improving search using indexing: a study with temporal CSPs, Proceedings of the 16th international joint conference on Artifical intelligence, p.436-441, July 31-August 06, 1999, Stockholm, Sweden