Sciweavers

2188 search results - page 180 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
15 years 5 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
CGIM
2003
15 years 5 months ago
A Novel Method for 3D Surface Mesh Segmentation
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...
Thitiwan Srinark, Chandra Kambhamettu
131
Voted
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 5 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 5 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
111
Voted
JSC
2008
78views more  JSC 2008»
15 years 4 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