Sciweavers

121 search results - page 16 / 25
» A bound on the number of points of a plane curve
Sort
View
RC
2002
103views more  RC 2002»
13 years 7 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 8 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
CTRSA
2004
Springer
114views Cryptology» more  CTRSA 2004»
14 years 23 days ago
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
Lejla Batina, Geeke Bruin-Muurling, Siddika Berna ...
GD
2009
Springer
14 years 2 hour ago
Drawing Hamiltonian Cycles with No Large Angles
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
Adrian Dumitrescu, János Pach, Géza ...
COMPGEOM
2004
ACM
14 years 24 days ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu