Sciweavers

2188 search results - page 240 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
VISUALIZATION
1999
IEEE
15 years 7 months ago
Rendering on a Budget: A Framework for Time-Critical Rendering
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
James T. Klosowski, Cláudio T. Silva
156
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 3 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
117
Voted
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
16 years 10 days ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 8 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen