Sciweavers

137 search results - page 9 / 28
» A Method for Classification of Convex Polygons
Sort
View
SIAMREV
2010
114views more  SIAMREV 2010»
14 years 10 months ago
From Random Polygon to Ellipse: An Eigenanalysis
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
Adam N. Elmachtoub, Charles F. Van Loan
CGF
2008
126views more  CGF 2008»
15 years 3 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
JMIV
2008
94views more  JMIV 2008»
15 years 3 months ago
Measuring Elongation from Shape Boundary
Abstract Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is the reason for its applicability in many shape classification tasks...
Milos Stojmenovic, Jovisa D. Zunic
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 10 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
DCG
2006
163views more  DCG 2006»
15 years 3 months ago
Isometry-Invariant Valuations on Hyperbolic Space
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
Daniel A. Klain