{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:51:47Z","timestamp":1772502707645,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0925-7721(02)00127-x","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T09:00:13Z","timestamp":1046422813000},"page":"13-20","source":"Crossref","is-referenced-by-count":22,"title":["On counting point-hyperplane incidences"],"prefix":"10.1016","volume":"25","author":[{"given":"Peter","family":"Brass","sequence":"first","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00127-X_BIB001","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/PL00009500","article-title":"Efficient algorithms for approximating polygonal chains","volume":"23","author":"Agarwal","year":"2000","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB002","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02574385","article-title":"Can visibility graphs be represented compactly?","volume":"12","author":"Agarwal","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB003","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jctb.1999.1906","article-title":"Norm-graphs: Variations and applications","volume":"76","author":"Alon","year":"1999","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB004","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0097-3165(79)90025-6","article-title":"Update on the no-three-in-line problem","volume":"27","author":"Anderson","year":"1979","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"1\u20132","key":"10.1016\/S0925-7721(02)00127-X_BIB005","first-page":"93","article-title":"Covering lattice points by subspaces","volume":"43","author":"B\u00e1r\u00e1ny","year":"2001","journal-title":"Periodica Mathematica Hungarica"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB006","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","article-title":"Cutting hyperplanes for divide-and-conquer","volume":"9","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB007","series-title":"Studies in Pure Mathematics, Mem. of P. Turan","first-page":"95","article-title":"On the decomposition of graphs into complete bipartite subgraphs","author":"Chung","year":"1983"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB008","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187783","article-title":"Combinatorial complexity bounds for arrangements of curves and spheres","volume":"5","author":"Clarkson","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB009","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0097-3165(76)90030-3","article-title":"On the no-three-in-line problem","volume":"20","author":"Craggs","year":"1976","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB010","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF02187742","article-title":"Implicitly representing arrangements of lines or segments","volume":"4","author":"Edelsbrunner","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB011","series-title":"Handbook of Combinatorics, Vol. 1","article-title":"Extremal problems in combinatorial geometry","author":"Erd\u0151s","year":"1995"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB012","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02712875","article-title":"New lower bounds for Hopcroft's problem","volume":"16","author":"Erickson","year":"1996","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB013","doi-asserted-by":"crossref","first-page":"1968","DOI":"10.1137\/S0097539798337212","article-title":"Space-time tradeoffs for emptiness queries","volume":"29","author":"Erickson","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB014","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1006\/jcss.1995.1065","article-title":"Clique partitions, graph compression and speeding-up algorithms","volume":"51","author":"Feder","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB015","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0097-3165(92)90012-J","article-title":"Progress in the no-three-in-line-problem","volume":"60","author":"Flammenkamp","year":"1992","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB016","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcta.1997.2829","article-title":"Progress in the no-three-in-line problem. II","volume":"81","author":"Flammenkamp","year":"1998","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB017","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0925-7721(95)00020-8","article-title":"The exact fitting problem for points","volume":"6","author":"Guibas","year":"1996","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB018","doi-asserted-by":"crossref","first-page":"527","DOI":"10.4153\/CMB-1968-062-3","article-title":"The no-three-in-line problem","volume":"11","author":"Guy","year":"1968","journal-title":"Can. Math. Bull."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB019","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB020","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0097-3165(75)90043-6","article-title":"Some advances in the no-three-in-line problem","volume":"18","author":"Hall","year":"1975","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB021","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(88)90135-5","article-title":"No-three-in-line for seventeen and nineteen","volume":"73","author":"Harborth","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB022","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01261323","article-title":"Norm-graphs and bipartite Turan numbers","volume":"16","author":"Kollar","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB023","first-page":"317","article-title":"Intersection graphs of segments","volume":"35","author":"Kratochv\u0131\u0301l","year":"1994","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB024","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","article-title":"Range searching with efficient hierarchical cuttings","volume":"10","author":"Matou\u0161ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00127-X_BIB025","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02579194","article-title":"Extremal problems in discrete geometry","volume":"3","author":"Szemer\u00e9di","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0925-7721(02)00127-X_BIB026","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02579163","article-title":"Covering of graphs by complete bipartite subgraphs; complexity of 0\u20131 matrices","volume":"4","author":"Tuza","year":"1984","journal-title":"Combinatorica"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210200127X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210200127X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:52:49Z","timestamp":1553673169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577210200127X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S092577210200127X"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00127-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}