Variations of largest rectangle recognition amidst a bichromatic point set-Reference-Cited by-同舟云学术

Variations of largest rectangle recognition amidst a bichromatic point set

Published:2020-11 Issue: Volume:286 Page:35-50
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Acharyya Ankush,De Minati,Nandy Subhas C.,Pandit Supantha

Funder

Indian Institute of Technology Delhi

Department of Science and Technology, Ministry of Science and Technology

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference39 articles.

1. Fast algorithms for computing the largest empty rectangle;Aggarwal,1987

2. B. Armaselu, O. Daescu, Maximum area rectangle separating red and blue points, in: Proceedings of the 28th Canadian Conference on Computational Geometry, 2016, pp. 244–251.

3. The bichromatic square and rectangle problems;Backer,2009

4. The mono-and bichromatic empty rectangle and square problems in all dimensions;Backer,2010

5. Polynomial time algorithms for bichromatic problems;Bandyapadhyay,2017

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An automatic robot for ultrasonic partial discharge detection of gas-insulated switchgear;Industrial Robot: the international journal of robotics research and application;2024-07-17

2. Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms;Acta Informatica;2023-08-01

3. Separating bichromatic point sets in the plane by restricted orientation convex hulls;Journal of Global Optimization;2022-10-10

4. Separating Bichromatic Polylines by Fixed-angle Minimal Triangles;Scientia Iranica;2022-04-26

5. Steganalysis for LSB inserts in low stego-payload artificial color images;Journal of Physics: Conference Series;2022-03-01