Efficient algorithms for geometric optimization

PK Agarwal, M Sharir - ACM Computing Surveys (CSUR), 1998 - dl.acm.org
We review the recent progress in the design of efficient algorithms for various problems in
geometric optimization. We present several techniques used to attack these problems, such …

Movable separability of sets

GT Toussaint - Machine Intelligence and Pattern Recognition, 1985 - Elsevier
Spurred by developments in spatial planning in robotics, computer graphics, and VLSI
layout, considerable attention has been devoted recently to the problem of moving sets of …

Davenport-Schinzel sequences and their geometric applications

M Sharir - Theoretical Foundations of Computer Graphics and …, 1995 - Springer
Davenport Schinzel sequences are sequences that do not contain forbidden alternating
subsequences of certain length. They are a powerful combinatorial tool applicable in …

[图书][B] Computer science handbook

AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

R-Net: A Deep Network for Multi-oriented Vehicle Detection in Aerial Images and Videos

Q Li, L Mou, Q Xu, Y Zhang, XX Zhu - arXiv preprint arXiv:1808.05560, 2018 - arxiv.org
Vehicle detection is a significant and challenging task in aerial remote sensing applications.
Most existing methods detect vehicles with regular rectangle boxes and fail to offer the …

Determining fabrication orientations for rapid prototyping with stereolithography apparatus

PT Lan, SY Chou, LL Chen, D Gemmill - Computer-Aided Design, 1997 - Elsevier
Traditionally, prototypes are built manually by skilled workers with the help of machine tools,
which is very time consuming. The advent of rapid prototyping technology greatly eases the …

Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

TM Chan - Proceedings of the sixteenth annual symposium on …, 2000 - dl.acm.org
Abstract We study (1+ e)-factor approximation algorithms for several well-known
optimization problems on a given npoint set:(a) diameter,(b) width,(c) smallest enclosing …

Convex decomposition for a coverage path planning for autonomous vehicles: Interior extension of edges

LD Nielsen, I Sung, P Nielsen - Sensors, 2019 - mdpi.com
To cover an area of interest by an autonomous vehicle, such as an Unmanned Aerial
Vehicle (UAV), planning a coverage path which guides the unit to cover the area is an …

[图书][B] Parallel computational geometry

SG Akl, KA Lyons - 1993 - dl.acm.org
Parallel computational geometry | Guide books skip to main content ACM Digital Library home
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …

Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error

U Roy, X Zhang - Computer-Aided Design, 1992 - Elsevier
The paper presents a computational-geometry-based method of determining the roundness
error of a measured workpiece. A set of n points (obtained from the measured workpiece) in …