Sciweavers

84 search results - page 14 / 17
» Elliptic Curves with a Given Number of Points
Sort
View
FOCS
1999
IEEE
14 years 27 days ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
CVPR
2005
IEEE
14 years 10 months ago
Visibility Constrained Surface Evolution
The problem of feature-based surface reconstruction is considered in this paper. Our main contribution is the ability to handle visibility constraints, obtained from the projectio...
Jan Erik Solem, Fredrik Kahl, Anders Heyden
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
IEEEMSP
2002
IEEE
14 years 1 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
13 years 10 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount