A wide-range algorithm for minimal triangulation from an arbitrary ordering

Heggernes, Pinar; Simonet, Geneviève; Villanger, Yngve; Bordat, Jean-Paul; Berry, Anne S

doi:10.1016/j.jalgor.2004.07.001

Record: found
Abstract: not found
Article: not found

A wide-range algorithm for minimal triangulation from an arbitrary ordering

Author(s): Anne Berry , Jean-Paul Bordat , Pinar Heggernes , Geneviève Simonet , Yngve Villanger

Publication date Created: January 2006

Publication date (Print): January 2006

Journal: Journal of Algorithms

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Journal of Algorithms

Abbreviated Title: Journal of Algorithms

Publisher: Elsevier BV

ISSN (Print): 01966774

Publication date Created: January 2006

Publication date (Print): January 2006

Volume: 58

Issue: 1

Pages: 33-66

Article

DOI: 10.1016/j.jalgor.2004.07.001

SO-VID: 16a1ccb5-06be-45f2-bed9-00eb97493c2d

License:

http://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

A wide-range algorithm for minimal triangulation from an arbitrary ordering

Read this article at

Related collections

Applications of SAXS

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,461

Cited by 3