Sciweavers

CAD
2010
Springer
13 years 7 months ago
Volumes with piecewise quadratic medial surface transforms: Computation of boundaries and trimmed offsets
MOS surfaces are rational surfaces in R3,1 which provide rational envelopes of the associated two-parameter family of spheres. Moreover, all the offsets admit rational parameteriz...
Bohumír Bastl, Bert Jüttler, Jir&iacut...
CAD
2010
Springer
13 years 7 months ago
Pattern computation for compression garment by a physical/geometric approach
This paper addresses the problem of computing planar patterns for compression garments. In the garment industry, the compression garment has been more and more widely used to reta...
Charlie C. L. Wang, Kai Tang
CAD
2010
Springer
13 years 7 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
CAD
2010
Springer
13 years 7 months ago
Feature aligned quad dominant remeshing using iterative local updates
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges well aligned to the principal directions of the underlying ...
Yu-Kun Lai, Leif Kobbelt, Shi-Min Hu
FOCS
2008
IEEE
13 years 7 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
FOCS
2008
IEEE
13 years 7 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
FOCS
2008
IEEE
13 years 7 months ago
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
Maurice Cheung, Chaitanya Swamy
FOCS
2008
IEEE
13 years 7 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
FOCS
2008
IEEE
13 years 7 months ago
Isotropic PCA and Affine-Invariant Clustering
S. Charles Brubaker, Santosh Vempala
CSE
2008
IEEE
13 years 7 months ago
Tail - A Java Technical Analysis Library
Márcio V. Santos, Alexandre Takinami, Alfre...