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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,983
Next 10 →

Parallelization of structured, hierarchical adaptive mesh refinement algorithms

by Charles A. Rendleman, Vincent E. Beckner, Mike Lijewski, William Crutchfield, John B. Bell - Computing and Visualization in Science , 2000
"... We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization are a ..."
Abstract - Cited by 39 (10 self) - Add to MetaCart
We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization

View-Dependent Refinement of Progressive Meshes

by Hugues Hoppe
"... Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for view-independent LOD. In this paper, ..."
Abstract - Cited by 459 (5 self) - Add to MetaCart
, we introduce a framework for selectively refining an arbitrary progressive mesh according to changing view parameters. We define efficient refinement criteria based on the view frustum, surface orientation, and screen-space geometric error, and develop a real-time algorithm for incrementally refining

Hierarchical model-based motion estimation

by James R. Bergen, P. Anandan, Th J. Hanna, Rajesh Hingorani , 1992
"... This paper describes a hierarchical estimation framework for the computation of diverse representations of motion information. The key features of the resulting framework (or family of algorithms) a,re a global model that constrains the overall structure of the motion estimated, a local rnodel that ..."
Abstract - Cited by 664 (15 self) - Add to MetaCart
This paper describes a hierarchical estimation framework for the computation of diverse representations of motion information. The key features of the resulting framework (or family of algorithms) a,re a global model that constrains the overall structure of the motion estimated, a local rnodel

A rapid hierarchical radiosity algorithm

by Pat Hanrahan, David Salzman - Computer Graphics , 1991
"... This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a user-supplied error bound. The a ..."
Abstract - Cited by 409 (11 self) - Add to MetaCart
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a user-supplied error bound

QSplat: A Multiresolution Point Rendering System for Large Meshes

by Szymon Rusinkiewicz, Marc Levoy , 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract - Cited by 502 (8 self) - Add to MetaCart
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing

Internet time synchronization: The network time protocol

by D. L. Mills , 1989
"... This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a self-organizing, hierarchi ..."
Abstract - Cited by 628 (15 self) - Add to MetaCart
-organizing, hierarchical, master-slave configuration synchronizes local clocks within the subnet and to national time standards via wire or radio. The servers can also redistribute time information within a network via local routing algorithms and time daemons. The architectures, algorithms and protocols which have

Crystallography & NMR system: A new software suite for macromolecular structure determination.

by Axel T Brünger , Paul D Adams , G Marius Clore , Warren L Delano , Piet Gros , Ralf W Grosse-Kunstleve , Jian-Sheng Jiang , John Kuszewski , Michael Nilges , Navraj S Pannu , Randy J Read , Luke M Rice , Thomas Simonson , Gregory L Warren - Acta Crystallogr. D Biol. Crystallogr. , 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract - Cited by 1411 (6 self) - Add to MetaCart
of CNS is highly flexible, allowing for extension to other structure determination methods, such as electron microscopy and solid state NMR spectroscopy. CNS has a hierarchical structure: a high-level hypertext markup language (HTML) user interface, task-oriented user input files, module files, a

Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments

by Thomas Funkhouser, Carlo Sequin , 1993
"... We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model representation in which objects are described at multiple levels of detail and can be drawn with various rendering algorithm ..."
Abstract - Cited by 450 (10 self) - Add to MetaCart
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model representation in which objects are described at multiple levels of detail and can be drawn with various rendering

Contour Detection and Hierarchical Image Segmentation

by Pablo Arbeláez, Michael Maire, Charless Fowlkes, Jitendra Malik - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2010
"... This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentati ..."
Abstract - Cited by 389 (24 self) - Add to MetaCart
and segmentation methods significantly outperform competing algorithms. The automatically generated hierarchical segmentations can be interactively refined by userspecified annotations. Computation at multiple image resolutions provides a means of coupling our system to recognition applications.

Hierarchical Packet Fair Queueing Algorithms

by Jon C. R. Bennett, Hui Zhang - IEEE/ACM Transactions on Networking , 1997
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS ..."
Abstract - Cited by 341 (7 self) - Add to MetaCart
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H
Next 10 →
Results 1 - 10 of 5,983
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