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
Constructing the constrained Delaunay triangulation on the Intel paragon
Full text PdfPdf (242 KB)
Source Symposium on Applied Computing archive
Proceedings of the 1997 ACM symposium on Applied computing table of contents
San Jose, California, United States
Pages: 464 - 467  
Year of Publication: 1997
ISBN:0-89791-850-9
Author
Fenglien Lee  Department of Computer Science, Winston-Salem State University, Winston-Salem, NC
Sponsors
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/331697.332333
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Chew, L.P., "Constrained Delaunay Triangulations", Algorithmica 4, Springer- Verlag, New York Inc., 1989, pp. 97-108.
2
L. Paul Chew, Guaranteed-quality mesh generation for curved surfaces, Proceedings of the ninth annual symposium on Computational geometry, p.274-280, May 18-21, 1993, San Diego, California, United States  [doi>10.1145/160985.161150]
3
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  [doi>10.1145/1122018.1122056]
 
4
Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
 
5
Paragon User's Guide, lntel Supercomputer System Division, pp. 1-1- 1-6, 1994.

CITED BY
Josef Kohout , Ivana Kolingerová , Jiří Žára, Parallel Delaunay triangulation in E2 and E3 for computers with shared memory, Parallel Computing, v.31 n.5, p.491-522, May 2005

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.0 General
          Subjects: Parallel algorithms

Additional Classification:
  E. Data

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
  I.3 COMPUTER GRAPHICS


General Terms:
Algorithms, Design, Performance, Theory


Keywords:
computational geometry, data structures, mesh generation, parallel algorithm, robotics

Collaborative Colleagues:
Fenglien Lee: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player