Sciweavers

330 search results - page 17 / 66
» Isosurfacing in higher dimensions
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Holographic Algorithms: The Power of Dimensionality Resolved
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
Jin-yi Cai, Pinyan Lu
ICCSA
2004
Springer
14 years 1 months ago
The Employment of Regular Triangulation for Constrained Delaunay Triangulation
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
Pavel Maur, Ivana Kolingerová
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
14 years 11 days ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
VIS
2008
IEEE
114views Visualization» more  VIS 2008»
14 years 9 months ago
Continuous Scatterplots
Abstract--Scatterplots are well established means of visualizing discrete data values with two data variables as a collection of discrete points. We aim at generalizing the concept...
Sven Bachthaler, Daniel Weiskopf
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 8 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri