Sciweavers

1095 search results - page 30 / 219
» Preprocessing of Intractable Problems
Sort
View
ACPC
1999
Springer
14 years 10 hour ago
Asynchronous Parallel Construction of Recursive Tree Hierarchies
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...
Dirk Bartz, Wolfgang Straßer
DAM
2011
13 years 2 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
WSCG
2004
143views more  WSCG 2004»
13 years 9 months ago
View Dependent Stochastic Sampling for Efficient Rendering of Point Sampled Surfaces
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Sushil Bhakar, Liang Luo, Sudhir P. Mudur
IVS
2007
140views more  IVS 2007»
13 years 7 months ago
Fast point-feature label placement for dynamic visualizations
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...
Kevin Mote