A new approach to rectangle intersections Part II

The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics Vol. 13; no. 3-4; pp. 221 - 229
Main Author: Edelsbrunner, Herbert
Format: Journal Article
Language:English
Published: Gordon and Breach Science Publishers 01.01.1983
Subjects:
ISSN:0020-7160, 1029-0265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.
AbstractList The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.
Author Edelsbrunner, Herbert
Author_xml – sequence: 1
  givenname: Herbert
  surname: Edelsbrunner
  fullname: Edelsbrunner, Herbert
  organization: Institute for Information Processing , Technical University of Graz
BookMark eNp9j0FLxDAQhYOsYHf1B3jr1UN10rRJCl6WRVdhwYueyzRNNNJNShJY9t_bsp4UvcxjmPke7y3JwnmnCbmmcEtBwh1ACYJyyUBKYIzXZySjUDYFlLxekGy-F9MDXJBljJ8AIBvBM3Kzzp0-5DiOwaP6yJPPg1YJ3fugc-uSDnFarXfxkpwbHKK--tYVeXt8eN08FbuX7fNmvStUSWkq6kop0dSa9walruQ0oBOUoqyF6KoOqOaTYl8braqeiYZVVAhVcSO50ZytiDj5quBjDNq0yiacI6SAdmgptHPj9lfjiaQ_yDHYPYbjv8z9ibHO-LDHgw9D3yY8Dj6YgE7Z2LK_8S_PXmtk
CitedBy_id crossref_primary_10_1007_s10845_008_0130_4
crossref_primary_10_1023_A_1009795512753
crossref_primary_10_1109_69_667079
crossref_primary_10_1109_5_163409
crossref_primary_10_1016_0306_4379_96_00015_4
crossref_primary_10_1016_S0020_0190_02_00347_2
crossref_primary_10_1007_BF01840366
crossref_primary_10_1007_BF01840388
crossref_primary_10_1016_0020_0255_87_90018_1
crossref_primary_10_1109_TIT_1983_1056714
crossref_primary_10_1109_TVLSI_2008_2001238
crossref_primary_10_1007_s00186_011_0356_3
crossref_primary_10_1023_B_REOM_0000032121_21617_38
crossref_primary_10_1016_j_jpdc_2018_01_010
crossref_primary_10_1016_j_comgeo_2006_03_005
crossref_primary_10_1016_j_is_2018_01_010
crossref_primary_10_1109_TC_1984_1676388
crossref_primary_10_1109_TC_1984_5009341
crossref_primary_10_1023_A_1006171919920
crossref_primary_10_1109_69_219737
crossref_primary_10_1145_384192_384193
Cites_doi 10.1145/322276.322281
10.1016/0020-0190(79)90117-0
10.1109/TC.1982.1675973
10.1007/BF01933636
10.1016/0196-6774(81)90033-X
10.1109/TC.1980.1675628
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1983
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1983
DBID AAYXX
CITATION
DOI 10.1080/00207168308803365
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1029-0265
EndPage 229
ExternalDocumentID 10_1080_00207168308803365
8803365
GroupedDBID -~X
07G
0R~
1TA
4.4
5GY
5VS
AAIKQ
AAKBW
AAYJJ
ABEFU
ABJNI
ABUFD
ACGEE
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ADCVX
ADXPE
AENEX
AEPSL
AEUMN
AEYOC
AFFNX
AGLEN
AI.
ALMA_UNASSIGNED_HOLDINGS
AMVHM
AMXXU
AQTUD
AWYRJ
BCCOT
BPLKW
C06
CS3
DU5
DWIFK
EBS
EJD
H13
HZ~
IVXBP
NA5
NUSFT
O9-
P2P
PQQKQ
TAQ
TDBHL
TFL
TFMCV
TFW
TN5
TOXWX
UB9
UPT
UU8
V3K
V4Q
VH1
WH7
ZY4
.4S
.7F
.DC
.QJ
0BK
29J
30N
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABDBF
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACAGQ
ACTCW
ACTIO
ACUHS
ADGTB
AEISY
AEOZL
AFKVX
AFRVT
AGCQS
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALQZU
AMEWO
AQRUH
ARCSS
AVBZW
BLEHA
CAG
CCCUG
CE4
CITATION
COF
CRFIH
DGEBU
DKSSO
DMQIW
EAP
EDO
EMK
EPL
EST
ESX
E~A
E~B
GTTXZ
HF~
H~9
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
MK~
NY~
QCRFL
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TEJ
TFT
TTHFI
TUROJ
TUS
TWF
UT5
UU3
ZGOLN
~S~
ID FETCH-LOGICAL-c211t-54cc795e6dfa8e48a8e0b711a8577b4b01e67b4ad5fec4d37934177c46f86fe63
IEDL.DBID TFW
ISSN 0020-7160
IngestDate Tue Nov 18 22:16:39 EST 2025
Sat Nov 29 02:21:21 EST 2025
Mon Oct 20 23:43:44 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3-4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c211t-54cc795e6dfa8e48a8e0b711a8577b4b01e67b4ad5fec4d37934177c46f86fe63
PageCount 9
ParticipantIDs crossref_citationtrail_10_1080_00207168308803365
crossref_primary_10_1080_00207168308803365
informaworld_taylorfrancis_310_1080_00207168308803365
PublicationCentury 1900
PublicationDate 1/1/1983
1983-01-00
PublicationDateYYYYMMDD 1983-01-01
PublicationDate_xml – month: 01
  year: 1983
  text: 1/1/1983
  day: 01
PublicationDecade 1980
PublicationTitle International journal of computer mathematics
PublicationYear 1983
Publisher Gordon and Breach Science Publishers
Publisher_xml – name: Gordon and Breach Science Publishers
References Six H.-W. (CIT0009) 1980; 20
Fredman M. L. (CIT0006) 1981; 28
CIT0011
CIT0003
Bentley J. L. (CIT0001) 1979; 8
Bentley J. L. (CIT0002) 1980; 29
CIT0005
CIT0004
Six H.-W. (CIT0010) 1982; 31
Lee D. T. (CIT0007) 1981; 2
References_xml – ident: CIT0003
– volume: 28
  start-page: 696
  year: 1981
  ident: CIT0006
  publication-title: J. of the ACM
  doi: 10.1145/322276.322281
– volume: 8
  start-page: 244
  year: 1979
  ident: CIT0001
  publication-title: Inf. Proc. Lett.
  doi: 10.1016/0020-0190(79)90117-0
– volume: 31
  start-page: 181
  year: 1982
  ident: CIT0010
  publication-title: IEEE Tr. on Comp.
  doi: 10.1109/TC.1982.1675973
– volume: 20
  start-page: 426
  year: 1980
  ident: CIT0009
  publication-title: BIT 20
  doi: 10.1007/BF01933636
– ident: CIT0011
– ident: CIT0004
– ident: CIT0005
– volume: 2
  start-page: 337
  year: 1981
  ident: CIT0007
  publication-title: J. of Algorithms
  doi: 10.1016/0196-6774(81)90033-X
– volume: 29
  start-page: 571
  year: 1980
  ident: CIT0002
  publication-title: IEEE Tr. on Comp.
  doi: 10.1109/TC.1980.1675628
SSID ssj0008976
Score 1.3172921
Snippet The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 221
SubjectTerms Computational geometry
concrete complexity
data structure
E.1. [Data]: Data structures-trees
F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical algorithms and problems-geometrical problems and computation, sorting and searching
H.3.3 [Information Storage and Retrieval]: Information search and retrieval-search process
intersection
rectilinearly-oriented rectangle
searching problem
Subtitle Part II
Title A new approach to rectangle intersections
URI https://www.tandfonline.com/doi/abs/10.1080/00207168308803365
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1029-0265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008976
  issn: 0020-7160
  databaseCode: TFW
  dateStart: 19640101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEA6yePDi-sT1RQ5eFAKpeR8XsXiQxcOqeytJmoiwdGVb_f0mfbEr6kEv7WWmlCTfTCaZ-QaAC88wFRpTFCIvjWjwWUjnlCDBnDfK41zVt-dP92IykbOZemhzc8o2rTLG0L4hiqhtdQS3NmWXERcruINj5JIEhGBCeCwxD24_wnKaPvd2WKq6tVyURkG8v9P87gtrXmmNs3TF26TDf_7nDthut5lw3KyLXbDhij0w7Fo4wBbR--ByDMO-GnbM4rBawGgCdfEydzBSSSzLOlerKA_AY3o7vblDbfcEZENQVyFGrRWKOZ57LR2V4YGNSBItmRCGGpw4Ht46Z95ZmpMAVJoIYSn3knvHySEYFIvCHQGYUOu8MCYGsNTmRFsdcHsttFA2lt6OAO5GL7MttXjscDHPkp6B9MtQjMBVr_LW8Gr8JsxWpySr6sMM33QeyciPesd_1DsBW4mSpDlpOQWDavnuzsCm_ahey-V5vco-AS9ny9k
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BQYKF8hTl6YEFJEsJtmNnrBBVEaViKNAtchwbVapS1AR-P3ZeahEwwJIsd1Fk-7vznc_fAVwY5lEuPYpt5CUxtT4Ly4QSzJk2cWi8JCxOz58HfDgU43H4WCXcsqqs0sXQpiSKKGy1A7dLRtclce4Kt_WMgSAWIh4hAVuFNWb9rOPOH_VeGksswqK5nBPHVr451fzuE0t-aYm1dMHf9Nr__dNt2Kp2mqhbLo0dWNHpLrTrLg6oAvUeXHaR3Vqjmlwc5TPkrKBMX6caOTaJeVaUa6XZPjz1bkc3fVw1UMDKxnU5ZlQpHjIdJEYKTYV9eDH3fSkY5zGNPV8H9i0TZrSiCbFYpT7nigZGBEYH5ABa6SzVh4B8qrThcexiWKoSIpW00L3mkofK3b7tgFcPX6QqdnHX5GIa-Q0J6Zeh6MBVo_JWUmv8JswW5yTKi3yGKZuPRORHvaM_6p3DRn_0MIgGd8P7Y9j0Q0HKxMsJtPL5uz6FdfWRT7L5WbHkPgE4MNAD
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_oFPHi_MT5mYMXhUBr0iQ9DnUojrHD1N1KmiYijG6s1b_fpF9soh700lzeCyV5n8nL7wFcmMCjXHoU28xLYmp9FpYJJZgH2sSh8ZKwuD1_7vPBQIzH4bCqzcmqskqXQ5sSKKKw1U65Z4mpK-LcC27rGJkgVkM8QliwCms2bGZOwEe9l8YQi7DoLefIsaVvLjW_m2LJLS2Bli64m177nz-6DVtVnIm6pWDswIpOd6Fd93BAlUrvwWUX2cAa1dDiKJ8iZwNl-jrRyGFJzLOiWCvN9uGpdze6ucdV-wSsbFaX44AqxcNAs8RIoamwHy_mvi9FwHlMY8_XzI4yCYxWNCFWU6nPuaLMCGY0IwfQSqepPgTkU6UNj2OXwVKVEKmkVdxrLnmo3NvbDnj16kWqwhZ3LS4mkd9AkH5Zig5cNSyzEljjN-JgcUuivDjNMGXrkYj8yHf0R75z2Bje9qL-w-DxGDb9UJDy1OUEWvn8XZ_CuvrI37L5WSFwn-GNzrU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+approach+to+rectangle+intersections&rft.jtitle=International+journal+of+computer+mathematics&rft.au=Edelsbrunner%2C+Herbert&rft.date=1983-01-01&rft.pub=Gordon+and+Breach+Science+Publishers&rft.issn=0020-7160&rft.eissn=1029-0265&rft.volume=13&rft.issue=3-4&rft.spage=221&rft.epage=229&rft_id=info:doi/10.1080%2F00207168308803365&rft.externalDocID=8803365
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon