• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Compact Data Structures with Fast Queries (2005)

by Daniel K Blandford
Add To MetaCart

Tools

Sorted by:
Results 1 - 4 of 4

A Fast and Compact Web Graph Representation

by Francisco Claude, Gonzalo Navarro
"... Compressed graphs representation has become an attractive research topic because of its applications in the manipulation of huge Web graphs in main memory. By far the best current result is the technique by Boldi and Vigna, which takes advantage of several particular properties of Web graphs. In t ..."
Abstract - Cited by 28 (17 self) - Add to MetaCart
Compressed graphs representation has become an attractive research topic because of its applications in the manipulation of huge Web graphs in main memory. By far the best current result is the technique by Boldi and Vigna, which takes advantage of several particular properties of Web graphs. In this paper we show that the same properties can be exploited with a different and elegant technique, built on Re-Pair compression, which achieves about the same space but much faster navigation of the graph. Moreover, the technique has the potential of adapting well to secondary memory. In addition, we introduce an approximate Re-Pair version that works efficiently with limited main memory.
(Show Context)

Citation Context

...hat of graph separators. Although the separator concept has been used a few times [10, 14, 8] (yet not suporting access to the compressed graph), the most striking results are achieved in recent work =-=[5, 4]-=-. Their idea is to find graph components that can be disconnected from the rest by removing a small number of edges. Then, the nodes within each component can be renumbered to achieve smaller node ide...

SVR: Practical Engineering of a Fast 3D Meshing Algorithm

by Umut A. Acar, Benoit Hudson, Gary L. Miller, Todd Phillips , 2007
"... The recent Sparse Voronoi Refinement (SVR) Algorithm for mesh generation has the fastest theoretical bounds for runtime and memory usage. We present a robust practical software implementation of the SVR for meshing a piecewise linear complex in 3 dimensions. Our software is competitive in runtime wi ..."
Abstract - Cited by 10 (8 self) - Add to MetaCart
The recent Sparse Voronoi Refinement (SVR) Algorithm for mesh generation has the fastest theoretical bounds for runtime and memory usage. We present a robust practical software implementation of the SVR for meshing a piecewise linear complex in 3 dimensions. Our software is competitive in runtime with state of the art freely available packages on generic inputs, and on pathological worse cases inputs, we show SVR indeed leverages its theoretical guarantees to produce vastly superior runtime and memory usage. The theoretical algorithm description of SVR leaves open several data structure design options, especially with regard to point location strategies. We show that proper strategic choices can greatly effect constant factors involved in runtime.
(Show Context)

Citation Context

...fore predict that, with relatively little effort, we could scale our implementation to much larger sizes than tested here simply by replacing the underlying structure with a compressed mesh structure =-=[Bla05]-=-. The topological structure is also largely compatible with the CGAL structures; one could write a thin adapter class to view one structure as the other. We chose to write our own structure in order t...

Dynamic Mesh Refinement

by Benoît Hudson, Anupam Gupta, Daniel D. K. Sleator , 2007
"... Mesh refinement is the problem to produce a triangulation (typically Delaunay) of an input set of points augmented by Steiner points, such that every triangle or tetrahedron has good quality (no small angles). The requirement arises from the applications: in scientific computing and in graphics, mes ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Mesh refinement is the problem to produce a triangulation (typically Delaunay) of an input set of points augmented by Steiner points, such that every triangle or tetrahedron has good quality (no small angles). The requirement arises from the applications: in scientific computing and in graphics, meshes are often used to discretely represent the value of a function over space. In addition to the quality requirement, the user often has input segments or polygons (generally, a piecewise linear complex) they would like see retained in the mesh; the mesh must respect these constraints. Finally, the mesh should be size-conforming: the size of mesh elements should be related to a particular sizing function based on the distance between input features. The static meshing problem is increasingly well-understood: one can download software with provable guarantees that on reasonable input, the meshes will have good quality, will respect the input, and will be size-conforming; more recently, these algorithms have started to come with optimal runtimes of O(n lg(L/s) +m), where L/s is the spread of the input. As a first result, I

Succinct Representation of Well-Spaced Point Clouds

by Benoît Hudson , 909
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University