Skip to main content
SpringerLink
Log in

Division of a Set of Segments into Nonintersecting Parts on a Discrete Plane

  • Published:
Russian Physics Journal Aims and scope

Abstract

The problem of dividing segments into nonintersecting parts on a discrete plane is considered. An algorithm for solving this problem and methods of its further improvement are suggested. The complexity of the algorithm is analyzed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. F. Preparata, and M. Shamos, Computational Geometry: an Introduction [Russian translation], Mir, Moscow (1989).

    Google Scholar 

  2. M. Laszlo, Computing Geometry and Graphics on C ++ [Russian translation], BINOM, Moscow (1997).

    Google Scholar 

  3. J. Rogers, Algorithmic Principles of Computer Graphics [Russian translation], Mir, Moscow (1989).

    Google Scholar 

  4. A. V. Skvorsov and Yu. L. Kostyuk, in: Geoinformatics. Theory and Practice. Vol 1 [in Russian], Publishing House of Tomsk State University, Tomsk (1998), pp. 22-47.

    Google Scholar 

  5. A. V. Koshkarev and V. S. Tikunov, Geoinformatics [in Russian], Kartgeotsentr-Geodezizdat, Moscow (1993).

    Google Scholar 

  6. A. Guttmann, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1984), pp. 47-57.

Download references

Author information

Authors and Affiliations

  1. Tomsk State University, Russia

    A. V. Skvortsov

Authors
  1. A. V. Skvortsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skvortsov, A.V. Division of a Set of Segments into Nonintersecting Parts on a Discrete Plane. Russian Physics Journal 45, 352–355 (2002). https://doi.org/10.1023/A:1020522922514

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020522922514

Keywords

Search

Navigation