Construction of the Delaunay Superlarge Triangulation

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·N2/3 is suggested.

Gespeichert in:

Autor*in:	Skvortsov, A. V. [verfasserIn]

Format:	Artikel
Sprache:	Englisch

Erschienen:	2002

Schlagwörter:	Delaunay Triangulation

Anmerkung:	© Plenum Publishing Corporation 2002

Übergeordnetes Werk:	Enthalten in: Russian physics journal - Kluwer Academic Publishers-Plenum Publishers, 1992, 45(2002), 6 vom: Juni, Seite 558-561
Übergeordnetes Werk:	volume:45 ; year:2002 ; number:6 ; month:06 ; pages:558-561

Links:	Volltext

DOI / URN:	10.1023/A:1021143217586

Katalog-ID:	OLC203305859X

Internformat


LEADER	01000caa a22002652 4500
001	OLC203305859X
003	DE-627
005	20230504035725.0
007	tu
008	200820s2002 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1023/A:1021143217586 \|2 doi
035			\|a (DE-627)OLC203305859X
035			\|a (DE-He213)A:1021143217586-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 530 \|a 370 \|q VZ
100	1		\|a Skvortsov, A. V. \|e verfasserin \|4 aut
245	1	0	\|a Construction of the Delaunay Superlarge Triangulation
264		1	\|c 2002
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
500			\|a © Plenum Publishing Corporation 2002
520			\|a 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·N2/3 is suggested.
650		4	\|a Delaunay Triangulation
773	0	8	\|i Enthalten in \|t Russian physics journal \|d Kluwer Academic Publishers-Plenum Publishers, 1992 \|g 45(2002), 6 vom: Juni, Seite 558-561 \|w (DE-627)131169718 \|w (DE-600)1138228-4 \|w (DE-576)033029253 \|x 1064-8887 \|7 nnns
773	1	8	\|g volume:45 \|g year:2002 \|g number:6 \|g month:06 \|g pages:558-561
856	4	1	\|u https://doi.org/10.1023/A:1021143217586 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-PHY
912			\|a GBV_ILN_40
912			\|a GBV_ILN_70
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 45 \|j 2002 \|e 6 \|c 06 \|h 558-561

Indexfelder

author_variant	a v s av avs
matchkey_str	article:10648887:2002----::osrcinfhdluaspragt
hierarchy_sort_str	2002
publishDate	2002
allfields	10.1023/A:1021143217586 doi (DE-627)OLC203305859X (DE-He213)A:1021143217586-p DE-627 ger DE-627 rakwb eng 530 370 VZ Skvortsov, A. V. verfasserin aut Construction of the Delaunay Superlarge Triangulation 2002 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Plenum Publishing Corporation 2002 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·N2/3 is suggested. Delaunay Triangulation Enthalten in Russian physics journal Kluwer Academic Publishers-Plenum Publishers, 1992 45(2002), 6 vom: Juni, Seite 558-561 (DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253 1064-8887 nnns volume:45 year:2002 number:6 month:06 pages:558-561 https://doi.org/10.1023/A:1021143217586 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700 AR 45 2002 6 06 558-561
spelling	10.1023/A:1021143217586 doi (DE-627)OLC203305859X (DE-He213)A:1021143217586-p DE-627 ger DE-627 rakwb eng 530 370 VZ Skvortsov, A. V. verfasserin aut Construction of the Delaunay Superlarge Triangulation 2002 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Plenum Publishing Corporation 2002 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·N2/3 is suggested. Delaunay Triangulation Enthalten in Russian physics journal Kluwer Academic Publishers-Plenum Publishers, 1992 45(2002), 6 vom: Juni, Seite 558-561 (DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253 1064-8887 nnns volume:45 year:2002 number:6 month:06 pages:558-561 https://doi.org/10.1023/A:1021143217586 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700 AR 45 2002 6 06 558-561
allfields_unstemmed	10.1023/A:1021143217586 doi (DE-627)OLC203305859X (DE-He213)A:1021143217586-p DE-627 ger DE-627 rakwb eng 530 370 VZ Skvortsov, A. V. verfasserin aut Construction of the Delaunay Superlarge Triangulation 2002 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Plenum Publishing Corporation 2002 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·N2/3 is suggested. Delaunay Triangulation Enthalten in Russian physics journal Kluwer Academic Publishers-Plenum Publishers, 1992 45(2002), 6 vom: Juni, Seite 558-561 (DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253 1064-8887 nnns volume:45 year:2002 number:6 month:06 pages:558-561 https://doi.org/10.1023/A:1021143217586 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700 AR 45 2002 6 06 558-561
allfieldsGer	10.1023/A:1021143217586 doi (DE-627)OLC203305859X (DE-He213)A:1021143217586-p DE-627 ger DE-627 rakwb eng 530 370 VZ Skvortsov, A. V. verfasserin aut Construction of the Delaunay Superlarge Triangulation 2002 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Plenum Publishing Corporation 2002 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·N2/3 is suggested. Delaunay Triangulation Enthalten in Russian physics journal Kluwer Academic Publishers-Plenum Publishers, 1992 45(2002), 6 vom: Juni, Seite 558-561 (DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253 1064-8887 nnns volume:45 year:2002 number:6 month:06 pages:558-561 https://doi.org/10.1023/A:1021143217586 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700 AR 45 2002 6 06 558-561
allfieldsSound	10.1023/A:1021143217586 doi (DE-627)OLC203305859X (DE-He213)A:1021143217586-p DE-627 ger DE-627 rakwb eng 530 370 VZ Skvortsov, A. V. verfasserin aut Construction of the Delaunay Superlarge Triangulation 2002 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Plenum Publishing Corporation 2002 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·N2/3 is suggested. Delaunay Triangulation Enthalten in Russian physics journal Kluwer Academic Publishers-Plenum Publishers, 1992 45(2002), 6 vom: Juni, Seite 558-561 (DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253 1064-8887 nnns volume:45 year:2002 number:6 month:06 pages:558-561 https://doi.org/10.1023/A:1021143217586 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700 AR 45 2002 6 06 558-561
language	English
source	Enthalten in Russian physics journal 45(2002), 6 vom: Juni, Seite 558-561 volume:45 year:2002 number:6 month:06 pages:558-561
sourceStr	Enthalten in Russian physics journal 45(2002), 6 vom: Juni, Seite 558-561 volume:45 year:2002 number:6 month:06 pages:558-561
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Delaunay Triangulation
dewey-raw	530
isfreeaccess_bool	false
container_title	Russian physics journal
authorswithroles_txt_mv	Skvortsov, A. V. @@aut@@
publishDateDaySort_date	2002-06-01T00:00:00Z
hierarchy_top_id	131169718
dewey-sort	3530
id	OLC203305859X
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203305859X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504035725.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2002 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1021143217586</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203305859X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1021143217586-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">530</subfield><subfield code="a">370</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Skvortsov, A. V.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Construction of the Delaunay Superlarge Triangulation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2002</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Plenum Publishing Corporation 2002</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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·N2/3 is suggested.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delaunay Triangulation</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Russian physics journal</subfield><subfield code="d">Kluwer Academic Publishers-Plenum Publishers, 1992</subfield><subfield code="g">45(2002), 6 vom: Juni, Seite 558-561</subfield><subfield code="w">(DE-627)131169718</subfield><subfield code="w">(DE-600)1138228-4</subfield><subfield code="w">(DE-576)033029253</subfield><subfield code="x">1064-8887</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:45</subfield><subfield code="g">year:2002</subfield><subfield code="g">number:6</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:558-561</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1021143217586</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">45</subfield><subfield code="j">2002</subfield><subfield code="e">6</subfield><subfield code="c">06</subfield><subfield code="h">558-561</subfield></datafield></record></collection>
author	Skvortsov, A. V.
spellingShingle	Skvortsov, A. V. ddc 530 misc Delaunay Triangulation Construction of the Delaunay Superlarge Triangulation
authorStr	Skvortsov, A. V.
ppnlink_with_tag_str_mv	@@773@@(DE-627)131169718
format	Article
dewey-ones	530 - Physics 370 - Education
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	1064-8887
topic_title	530 370 VZ Construction of the Delaunay Superlarge Triangulation Delaunay Triangulation
topic	ddc 530 misc Delaunay Triangulation
topic_unstemmed	ddc 530 misc Delaunay Triangulation
topic_browse	ddc 530 misc Delaunay Triangulation
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Russian physics journal
hierarchy_parent_id	131169718
dewey-tens	530 - Physics 370 - Education
hierarchy_top_title	Russian physics journal
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)131169718 (DE-600)1138228-4 (DE-576)033029253
title	Construction of the Delaunay Superlarge Triangulation
ctrlnum	(DE-627)OLC203305859X (DE-He213)A:1021143217586-p
title_full	Construction of the Delaunay Superlarge Triangulation
author_sort	Skvortsov, A. V.
journal	Russian physics journal
journalStr	Russian physics journal
lang_code	eng
isOA_bool	false
dewey-hundreds	500 - Science 300 - Social sciences
recordtype	marc
publishDateSort	2002
contenttype_str_mv	txt
container_start_page	558
author_browse	Skvortsov, A. V.
container_volume	45
class	530 370 VZ
format_se	Aufsätze
author-letter	Skvortsov, A. V.
doi_str_mv	10.1023/A:1021143217586
dewey-full	530 370
title_sort	construction of the delaunay superlarge triangulation
title_auth	Construction of the Delaunay Superlarge Triangulation
abstract	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·N2/3 is suggested. © Plenum Publishing Corporation 2002
abstractGer	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·N2/3 is suggested. © Plenum Publishing Corporation 2002
abstract_unstemmed	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·N2/3 is suggested. © Plenum Publishing Corporation 2002
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_40 GBV_ILN_70 GBV_ILN_4700
container_issue	6
title_short	Construction of the Delaunay Superlarge Triangulation
url	https://doi.org/10.1023/A:1021143217586
remote_bool	false
ppnlink	131169718
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1023/A:1021143217586
up_date	2024-07-03T15:31:46.394Z
_version_	1803572432225697792
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203305859X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504035725.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2002 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1021143217586</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203305859X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1021143217586-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">530</subfield><subfield code="a">370</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Skvortsov, A. V.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Construction of the Delaunay Superlarge Triangulation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2002</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Plenum Publishing Corporation 2002</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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·N2/3 is suggested.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delaunay Triangulation</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Russian physics journal</subfield><subfield code="d">Kluwer Academic Publishers-Plenum Publishers, 1992</subfield><subfield code="g">45(2002), 6 vom: Juni, Seite 558-561</subfield><subfield code="w">(DE-627)131169718</subfield><subfield code="w">(DE-600)1138228-4</subfield><subfield code="w">(DE-576)033029253</subfield><subfield code="x">1064-8887</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:45</subfield><subfield code="g">year:2002</subfield><subfield code="g">number:6</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:558-561</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1021143217586</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">45</subfield><subfield code="j">2002</subfield><subfield code="e">6</subfield><subfield code="c">06</subfield><subfield code="h">558-561</subfield></datafield></record></collection>
score	7.399063

Nicht das Richtige dabei?

Schreiben Sie uns!

Construction of the Delaunay Superlarge Triangulation

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?