This HTML5 document contains 99 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
n11https://archive.org/details/sofsem98theorypr0000sofs/page/
n16https://web.archive.org/web/20100613104635/http:/compgeom.cs.uiuc.edu/~jeffe/open/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14http://dbpedia.org/resource/File:
dbpedia-eshttp://es.dbpedia.org/resource/
n19https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n15https://cs.uwaterloo.ca/~tmchan/
freebasehttp://rdf.freebase.com/ns/
n22http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n21https://web.archive.org/web/20100618011523/http:/compgeom.cs.uiuc.edu/~jeffe/open/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_combinatorial_computational_geometry_topics
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:Jon_Bentley_(computer_scientist)
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:Victor_Klee
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
dbo:knownFor
dbr:Klee's_measure_problem
Subject Item
dbr:Convex_volume_approximation
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:Michael_Fredman
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:K-d_tree
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:Klee's_measure_problem
rdf:type
yago:YagoPermanentlyLocatedEntity yago:Attribute100024264 yago:WikicatGeometricAlgorithms yago:Procedure101023820 yago:Problem114410605 yago:Difficulty114408086 dbo:Disease yago:Condition113920835 yago:Abstraction100002137 yago:WikicatMathematicalProblems yago:Activity100407535 yago:PsychologicalFeature100023100 yago:State100024720 yago:Act100030358 yago:Rule105846932 yago:Algorithm105847438 yago:Event100029378
rdfs:label
Problema de la medida de Klee Klee's measure problem
rdfs:comment
En la geometría computacional, el problema de la medida de Klee es el problema de determinar cuan eficientemente la medida de una unión (multidimensional) de rangos rectangulares puede ser calculada. Aquí, un rango rectangular d-dimensional es definido como un producto cartesiano de d intervalos de números reales, que es un subconjunto de Rd. In computational geometry, Klee's measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d-dimensional rectangular range is defined to be a Cartesian product of d intervals of real numbers, which is a subset of Rd.
foaf:depiction
n22:Set_a_rectangles_(Klee's_Trevis).svg
dcterms:subject
dbc:Mathematical_problems dbc:Computational_geometry dbc:Measure_theory
dbo:wikiPageID
3107845
dbo:wikiPageRevisionID
991845497
dbo:wikiPageWikiLink
dbr:Victor_Klee dbr:Lecture_Notes_in_Computer_Science dbr:Computational_complexity_theory dbr:Jon_Bentley_(computer_scientist) dbr:Jan_van_Leeuwen dbr:Convex_volume_approximation dbr:Franco_P._Preparata dbr:Communications_of_the_ACM dbr:Quadtree dbr:Lower_bound dbr:Open_problem dbr:Michael_Fredman dbr:Computational_geometry dbr:Union_(set_theory) n14:Set_a_rectangles_(Klee's_Trevis).svg dbr:Trellis_(graph) dbr:SIAM_Journal_on_Computing dbc:Mathematical_problems dbr:Rectangle dbc:Computational_geometry dbr:Sorting dbr:Kd-tree dbr:Subset dbr:Convex_body dbr:Analysis_of_algorithms dbr:Mark_Overmars dbr:Real_number dbr:Computer_graphics dbr:Measure_(mathematics) dbr:Big_O_notation dbr:Cartesian_product dbr:Michael_Ian_Shamos dbr:Area_(geometry) dbr:Real_line dbr:Interval_(mathematics) dbr:American_Mathematical_Monthly dbr:Algorithm dbc:Measure_theory dbr:Dimension
dbo:wikiPageExternalLink
n11:304 n15:easyklee4_13.pdf%7Cisbn=978-0-7695-5135-7%7Cciteseerx=10.1.1.643.26%7Cs2cid=11648588 n16:klee.html n21:
owl:sameAs
yago-res:Klee's_measure_problem freebase:m.08rx8l n19:4pVFQ dbpedia-es:Problema_de_la_medida_de_Klee wikidata:Q6420068
dbp:wikiPageUsesTemplate
dbt:Citation dbt:Reflist
dbo:thumbnail
n22:Set_a_rectangles_(Klee's_Trevis).svg?width=300
dbo:abstract
In computational geometry, Klee's measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d-dimensional rectangular range is defined to be a Cartesian product of d intervals of real numbers, which is a subset of Rd. The problem is named after Victor Klee, who gave an algorithm for computing the length of a union of intervals (the case d = 1) which was later shown to be optimally efficient in the sense of computational complexity theory. The computational complexity of computing the area of a union of 2-dimensional rectangular ranges is now also known, but the case d ≥ 3 remains an open problem. En la geometría computacional, el problema de la medida de Klee es el problema de determinar cuan eficientemente la medida de una unión (multidimensional) de rangos rectangulares puede ser calculada. Aquí, un rango rectangular d-dimensional es definido como un producto cartesiano de d intervalos de números reales, que es un subconjunto de Rd. Este problema toma el nombre en honor a Victor Klee, quien dio un algoritmo para calcular la longitud de una unión de intervalos (el caso d = 1)​que más tarde mostró ser óptimamente eficiente en el sentido de la teoría de complejidad computacional. La complejidad computacional para calcular el área de una unión de rangos rectangulares 2-dimensionales ahora también es conocida, pero en el caso de d ≥ 3 sigue siendo un problema abierto.
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
wikipedia-en:Klee's_measure_problem?oldid=991845497&ns=0
dbo:wikiPageLength
8509
foaf:isPrimaryTopicOf
wikipedia-en:Klee's_measure_problem
Subject Item
dbr:Measure_problem
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
dbo:wikiPageDisambiguates
dbr:Klee's_measure_problem
Subject Item
dbr:Octree
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
Subject Item
dbr:Bentley's_algorithm
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
dbo:wikiPageRedirects
dbr:Klee's_measure_problem
Subject Item
dbr:Klee_measure_problem
dbo:wikiPageWikiLink
dbr:Klee's_measure_problem
dbo:wikiPageRedirects
dbr:Klee's_measure_problem
Subject Item
wikipedia-en:Klee's_measure_problem
foaf:primaryTopic
dbr:Klee's_measure_problem