Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

El Kahoui, M'hammed

dblp

Not MPG Author(s):

Gonzalez-Vega, Laureano

BibTeX cite key*:

ElKahoui1996

Title

Title*:

An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve

Journal

Journal Title*:

Journal of Complexity

Journal's URL:

http://www.elsevier.com/wps/find/journaldescription.cws_home/622865/description#description

Download URL
for the article:

http://www.sciencedirect.com/science?_ob=IssueURL&_tockey=%23TOC%236862%231996%23999879995%23308679%23FLT%23display%23Volume_12,_Issue_4,_Pages_255-624_(December_1996)%23tagged%23Volume%23first%3D12%23Issue%23first%3D4%23Pages%23first%3D255%23last%3D624%23date%23(December_1996)%23&_auth=y&view=c&_acct=C000004638&_version=1&_urlVersion=0&_userid=43521&md5=6759f47d24990790d346fac647d30de6

Language:

English

Publisher

Publisher's
Name:

Elsevier

Publisher's URL:

http://www.elsevier.com/wps/find/homepage.cws_home

Publisher's
Address:


ISSN:

0885-064X

Vol, No, pp, Date

Volume*:

12

Number:

4

Publishing Date:

1996

Pages*:

527-544

Number of
VG Pages:

18

Page Start:

527

Page End:

544

Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

The computation of the topological shape of a real algebraic plane curve is usually driven by the study of the behavior of the curve around its critical points (which includes also the singular points). In this paper we present a new algorithm computing the topological shape of a real algebraic plane curve whose complexity is better than the best algorithms known. This is due to the avoiding, through a sufficiently good change of coordinates, of real root computations on polynomials with coefficients in a simple real algebraic extension of $\mathbb{Q}$ to deal with the critical points of the considered curve. In fact, one of the main features of this algorithm is that its complexity is dominated by the characterization of the real roots of the discriminant of the polynomial defining the considered curve.

URL for the Abstract:


Categories,
Keywords:

Computational geometry, curve in generic position

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Intranet

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{ElKahoui1996,
AUTHOR = {El Kahoui, M'hammed},
TITLE = {An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve},
JOURNAL = {Journal of Complexity},
PUBLISHER = {Elsevier},
YEAR = {1996},
NUMBER = {4},
VOLUME = {12},
PAGES = {527--544},
ISBN = {0885-064X},
}


Entry last modified by Christine Kiesel, 05/30/2005
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
M'hammed El Kahoui
Created
02/25/2005 10:50:01 AM
Revisions
2.
1.
0.

Editor(s)
Christine Kiesel
M'hammed El Kahoui
M'hammed El Kahoui

Edit Dates
30.05.2005 16:25:37
02/25/2005 02:34:01 PM
02/25/2005 10:50:01 AM