Sciweavers

650 search results - page 19 / 130
» Generalized Self-Approaching Curves
Sort
View
COMPGEOM
2003
ACM
14 years 20 days ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
13 years 11 months ago
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
David Freeman
ECCV
2004
Springer
14 years 9 months ago
MCMC-Based Multiview Reconstruction of Piecewise Smooth Subdivision Curves with a Variable Number of Control Points
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
Michael Kaess, Rafal Zboinski, Frank Dellaert
COMPGEOM
2010
ACM
14 years 15 days ago
3D Euler spirals for 3D curve completion
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
Gur Harary, Ayellet Tal
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 7 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...