Sciweavers

138 search results - page 8 / 28
» The Complexity of Quickly ORM-Decidable Sets
Sort
View
IJFCS
2002
122views more  IJFCS 2002»
13 years 9 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
EURODAC
1994
IEEE
211views VHDL» more  EURODAC 1994»
14 years 1 months ago
Advanced simulation and modeling techniques for hardware quality verification of digital systems
synchronisation also play a fundamental role in overall system robustness. ElectroMagnetic Compatibility (EMC) and ElectroMagnetic Interference (EMI) issues also have to be conside...
S. Forno, Stephen Rochel
IJBC
2008
112views more  IJBC 2008»
13 years 9 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...
VC
2008
95views more  VC 2008»
13 years 9 months ago
1001 Acquisition viewpoints: efficient and versatile view-dependent modeling of real-world scenes
Modeling is a severe bottleneck for computer graphics applications. Manual modeling is time consuming and fails to capture the complexity of real world scenes. Automated modeling b...
Mihai Mudure, Voicu Popescu
CG
1998
Springer
13 years 9 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra