Mapping graphs on the sphere to the finite plane

H Bekker*, K De Raedt

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    A method is introduced to map a graph on the sphere to the finite plane. The method works by first mapping the graph on the sphere to a tetrahedron. Then the graph on the tetrahedron is mapped to the plane. Using this mapping, arc intersection on the sphere, overlaying subdivisions on the sphere and point location on the sphere may be done by using algorithms in the plane.

    Original languageEnglish
    Title of host publicationCOMPUTATIONAL SCIENCE-ICCS 2002, PT III, PROCEEDINGS
    EditorsP Sloot, CJK Tan, JJ Dongarra, AG Hoekstra
    Place of PublicationBERLIN
    PublisherSpringer
    Pages55-64
    Number of pages10
    ISBN (Print)3-540-43594-8
    Publication statusPublished - 2002
    EventInternational Conference on Computational Science - , Netherlands
    Duration: 21-Apr-200224-Apr-2002

    Publication series

    NameLECTURE NOTES IN COMPUTER SCIENCE
    PublisherSPRINGER-VERLAG BERLIN
    Volume2331
    ISSN (Print)0302-9743

    Other

    OtherInternational Conference on Computational Science
    Country/TerritoryNetherlands
    Period21/04/200224/04/2002

    Fingerprint

    Dive into the research topics of 'Mapping graphs on the sphere to the finite plane'. Together they form a unique fingerprint.

    Cite this