Sciweavers

1730 search results - page 85 / 346
» Shimura Curve Computations
Sort
View
151
Voted
GD
2005
Springer
15 years 10 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
15 years 4 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho
COMGEO
2006
ACM
15 years 4 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 4 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu
155
Voted
CVPR
2008
IEEE
16 years 6 months ago
Radiometric calibration using temporal irradiance mixtures
We propose a new method for sampling camera response functions: temporally mixing two uncalibrated irradiances within a single camera exposure. Calibration methods rely on some kn...
Bennett Wilburn, Hui Xu, Yasuyuki Matsushita