Guy Blelloch, Hal Burchy, Karl Crary, Robert Harper, Gary Miller, and Noel...  Home/Search
Context
Related
| cmu.edu/~rwh/papers/triangulat...jfp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~rwh/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Triangulations of a surface are of fundamental importance in computational geometry, computer graphics, and engineering and scienti c simulations. Triangulations are ordinarily represented as mutable graph structures for which both adding and traversing edges take constant time per operation. These representations of triangulations make it dicult to support persistence, including \multiple futures", the ability to use a data structure in several unrelated ways in a given computation; \time... (Update)
Similar documents (at the sentence level):
25.2%: Persistent Triangulations - Blelloch, Burch, Crary, Harper.. (1999) (Correct)
21.7%: Proceedings of the Workshop on Algorithmic Aspects of Advanced.. - Okasaki (1999) (Correct)
Active bibliography (related documents): More All
0.5: A New Method for Functional Arrays - O'Neill, Burton (1997) (Correct)
0.5: Adding Multidimensionality to Procedural Programming - Languages Rondogiannis.. (Correct)
0.5: Experiential And Formal Models Of Geographic Space - Mark, Frank (1995) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ hal-under,
author = "Guy Blelloch Hal",
title = "Under consideration for publication in J. Functional Programming 1 Persistent
Triangulations",
url = "citeseer.ist.psu.edu/751816.html" }
Citations (may not include all citations):335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stol - 1985
185 de nition of Standard ML (context) - Robin, Mads et al. - 1997
132 Randomized algorithms (context) - Rajeev - 1995
129 Making data structures persistent (context) - James, Sarnak et al. - 1989
106 Purely functional data structures - Chris - 1998
98 Fast polygonal approximation of terrains and height elds - Michael, Paul - 1995
91 The quickhull algorithm for convex hulls - Barber, Dobkin et al. - 1996
91 Computational geometry : Algorithms and applications (context) - Berg, De and et al. - 1997
90 Programming parallel algorithms - Guy - 1996
33 Fully persistent arrays (context) - Paul - 1989
21 An optimal convex hull algorithm and new results on cuttings (context) - Bernard - 1991
11 Symmetric binary B-trees: Data structure and maintenance alg.. (context) - Bayer - 1972
4 Elementary concepts of topology (context) - Paul - 1961
4 A Delaunay re nement algorithm for quality 2-dimensional mes.. (context) - Jim - 1995
3 Computing the convex hull in a functional language (context) - Hal, Gary et al. - 2000
2 London: Chapman and Hall (context) - Giblin - 1977
2 A new method for functional arrays (context) - Melissa, Burton et al. - 1997
2 Pages 66-75 of: Proceedings of the 11th acm symposium on pri.. (context) - Eugene, January et al. - 1984
Documents on the same site (http://www.cs.cmu.edu/~rwh/papers.htm): More
On the Unusual Effectiveness of Logic in Computer Science - Halpern, Harper.. (2000) (Correct)
Adaptive Functional Programming - Acar, Blelloch, Harper (2001) (Correct)
A Performance Comparison of Interval Arithmetic and.. - Seshia, Blelloch, Harper (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC