Sciweavers

9659 search results - page 31 / 1932
» Points on Computable Curves
Sort
View
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
14 years 1 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
CG
2011
Springer
13 years 1 months ago
Feature based volumes for implicit intersections
The automatic generation of volumes bounding the intersection of two implicit surfaces (isosurfaces of real functions of 3D point coordinates) or Feature Based Volumes (FBV) is pr...
Oleg Fryazinov, Pierre-Alain Fayolle, Turlif Vilbr...
COMPGEOM
2001
ACM
14 years 1 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
CVPR
2000
IEEE
14 years 11 months ago
A Curve Evolution Approach to Smoothing and Segmentation Using the Mumford-Shah Functional
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
IJNSEC
2011
78views more  IJNSEC 2011»
13 years 4 months ago
Multi-authority Electronic Voting Scheme Based on Elliptic Curves
In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the e...
Chinniah Porkodi, Ramalingam Arumuganathan, Krishn...