About: Space partitioning

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Space partitioning Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Election, within Data Space : el.dbpedia.org associated with source document(s)

In geometry, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non-overlapping regions. Any point in the space can then be identified to lie in exactly one of the regions.

Attributes	Values
rdf:type	Election
rdfs:label	Space partitioning (en)
rdfs:comment	In geometry, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non-overlapping regions. Any point in the space can then be identified to lie in exactly one of the regions. (en)
sameAs	Space partitioning Space partitioning
dbp:wikiPageUsesTemplate	dbt:Reflist
Subject	Computer graphics Geometric algorithms
gold:hypernym	Process
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Space_partitioning?oldid=1015016701&ns=0
Wikipage page ID	1676608 (xsd:integer)
page length (characters) of wiki page	6493 (xsd:nonNegativeInteger)
Wikipage revision ID	1015016701 (xsd:integer)
has abstract	In geometry, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non-overlapping regions. Any point in the space can then be identified to lie in exactly one of the regions. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Space_partitioning
is Wikipage redirect of	Spatial partitioning Spatial subdivision Space partition
is Link from a Wikipage to another Wikipage of	Ball tree Bin (computational geometry) CUDA Geocode Geometric design Geometric modeling Discrete global grid Cube 2: Sauerbraten K-d tree List of data structures Collision detection Computational geometry Kepler Engelbrecht Bounding interval hierarchy Growth function Nearest neighbor search

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software