Sciweavers

895 search results - page 25 / 179
» Approximate convex decomposition
Sort
View
MP
2002
84views more  MP 2002»
14 years 9 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 3 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
ISIPTA
1999
IEEE
15 years 1 months ago
Nonlinear Filtering of Convex Sets of Probability Distributions
A solution is provided to the problem of computing a convex set of conditional probability distributions that characterize the state of a nonlinear dynamic system as it evolves in...
John Kenney, Wynn C. Stirling
WSCG
2000
107views more  WSCG 2000»
14 years 11 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
61
Voted
IWCIA
2009
Springer
15 years 2 months ago
What Does Digital Straightness Tell about Digital Convexity?
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
Tristan Roussillon, Laure Tougne, Isabelle Sivigno...