Skip to main content
SpringerLink
Log in

Construction of the Delaunay Superlarge Triangulation

  • Published:
Russian Physics Journal Aims and scope

Abstract

The problem of constructing the Delaunay triangulation that certainly cannot be put in the RAM is considered. A box algorithm that allows the dimensionality of the examined problem to be reduced from N to ∼3.23·N 2/3 is suggested.

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. A. V. Skvortsov, Vychisl. Met. Programm., 3, No. 1, 14-39 (2002) (http: // num-meth.srcc.msu.su).

    Google Scholar 

  2. A. V. Skvortsov, Izv. Vyssh. Uchebn. Zaved., Fiz., No. 3, 120-126 (1999).

  3. T. Midtbi, Spatial Modeling by Delaunay Networks of Two and Three Dimensions, Doctoral Thesis, University of Trondheim (1993).

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. Construction of the Delaunay Superlarge Triangulation. Russian Physics Journal 45, 558–561 (2002). https://doi.org/10.1023/A:1021143217586

Download citation

  • Issue Date:

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

Keywords

Search

Navigation