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
Fly cheaply: on the minimum fuel-consumption problem
Full text PdfPdf (349 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents
Minneapolis, Minnesota, United States
Pages: 143 - 145  
Year of Publication: 1998
ISBN:0-89791-973-4
Authors
Alon Efrat  School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69982, Israel
Sariel Har-Peled  School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69982, Israel
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

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/276884.276900
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
P. K. AGARWAn AND J. MATOU#BK, Dynamic half-space range reporting and itn applications, Algorithmica, 13 (1095), pp. 325-34#.
 
2
P. K. AGa#wa#, O. SoHw#zKoPF, a# M. Smmm, Th6 overlay of lower envelopes and its applications, Discrete Compu#. Geom., 15 (1996), pp. 1-13.
 
3
T. H. CORZ#BN, C. E. LBXSBRSON, AND It. L. RIW#ST, Introduction to Al#orithms, The MIT Press, Cambridge, Mao#., 1990.
 
4
Jacob E. Goodman , Joseph O'Rourke, Handbook of discrete and computational geometry, CRC Press, Inc., Boca Raton, FL, 1997
 
5
D. HA#P#.Rm Am) M. S#m.m, Ne# bounds for lower envelopes in three dimensions, #ith applicaHons to visibility in terrains, Discrete Comput. Geom., 12 (1994), pp. 313-326.
6
Kentan Mulmuley, A fast planar partition algorithm, II, Journal of the ACM (JACM), v.38 n.1, p.74-103, Jan. 1991  [doi>10.1145/102782.102785]
 
7
Joseph O'Rourke, Computational geometry in C, Cambridge University Press, New York, NY, 1994
 
8
Raimund Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, v.1 n.1, p.51-64, July 1991  [doi>10.1016/S0925-7721(99)00042-5]

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Graphs and networks

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Path and circuit problems


General Terms:
Algorithms, Theory, Verification

Collaborative Colleagues:
Alon Efrat: colleagues
Sariel Har-Peled: colleagues

Peer to Peer - Readers of this Article have also read:

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