Sciweavers

11211 search results - page 315 / 2243
» Data Structures
Sort
View
FPCA
1995
15 years 10 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
COMPGEOM
2008
ACM
15 years 8 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
CCCG
2008
15 years 8 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
WSCG
2004
158views more  WSCG 2004»
15 years 8 months ago
JaGrLib: Library for Computer Graphics Education
This article describes JaGrLib
Josef Pelikán, Jan Kostlivý
ENTCS
2006
89views more  ENTCS 2006»
15 years 6 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke