Sciweavers

2342 search results - page 197 / 469
» Sublinear geometric algorithms
Sort
View
123
Voted
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 4 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
WSCG
2003
145views more  WSCG 2003»
15 years 4 months ago
Real-Time Soft Shadows Using a Single Light Sample
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
Florian Kirsch, Jürgen Döllner
104
Voted
JSC
2008
78views more  JSC 2008»
15 years 3 months ago
Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
Koji Ouchi, John Keyser
146
Voted
CAD
2005
Springer
15 years 3 months ago
Modeling generalized cylinders using direction map representation
For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in cylindrical type of dev...
Joo-Haeng Lee
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 26 days ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor