dbShape
Usage: dbShape [-help] [-d] [-step <step>] [-output {polygon rect hrect area}]
<shapeList> [AND <shapeList> | ANDNOT <shapeList> | OR <shapeList> | XOR <shapeList>
| INSIDE shapeList | OUTSIDE shapeList | ENCLOSE shapeList | STRADDLE shapeList
| BBOX | HOLES | NOHOLES | MOVE {<dx> <dy>} | SIZE <value> | SIZEX <value> | SIZEY <value>] ...
-help # Prints out the command usage
-d # User specified values and return values are in database units.
# Default: All values are in user units, in microns. (bool, optional)
-step <step> # Specifies step size if output format is rect, required to convert
# non-orthogonal shapes into series of rectangles. Default: minwidth
# value of first routing layer (coord, optional).
-output {polygon rect hrect area}
# Specifies the output format. (rect = vertical rectangles,
# hrect = horizontal rectangles), area = total area of final shape
# default: rect (enum, optional)
<shapeList> # polygon or rect or list of polygon and rect. polygon:
# {{x y} {x y} {x y} ... }; rect: {x1 y1 x2 y2} (list, required)
AND <shapeList> # binary operator: intersection of list of shapes
ANDNOT <shapeList> # binary operator: initial list of shapes minus second list of shapes
OR <shapeList> # binary operator: union of list of shapes
XOR <shapeList> # binary operator: union of list of shapes minus AND of the list of shapes
# (string, optional)
INSIDE <shapelist> # binary operator: initial shapes that are inside (including touching)
# of one of the shapes from the second list
OUTSIDE <shapelist># binary operator: initial shapes that are outside (including touching)
# of the shapes from the second list
ENCLOSE <shapelist># binary operator: initial shapes that completely enclose at least one shape from the second list
STRADDLE <shapelist>
# binary operator: initial shapes that are partially inside and partially outside
# at least one shape from the second list
MOVE {<dx> <dy>} # unary operator : move the list of shapes by {<dx> <dy>}
BBOX # unary operator : computes the bounding box of list of shapes
# (string, optional)
HOLES # unary operator : returns list of new shapes that fill holes in the original list of shapes
NOHOLES # unary operator : returns list of new shapes that include filled holes in the original list of shapes
# (same as dbShape $shapeList HOLES OR $shapeList)
SIZE <value> # unary operator : increase the size of list of shapes by <value>
SIZEX <value> # unary operator : increase the size of the list of shapes in the
# X-direction by <value>
SIZEY <value> # unary operator : increase the size of the list of shapes in the
# Y-direction by <value>
dbShape的更多相关文章
- 如何在前端通过JavaScript创建修改CAD图形
背景 在之前的博文CAD图DWG解析WebGIS可视化技术分析总结.CAD_DWG图Web可视化一站式解决方案-唯杰地图-vjmap中讲解了如何把CAD的DWG格式的图纸Web可视化的方案,那在Web ...
随机推荐
- 台大郭彦甫MATLAB教学-个人笔记(一)
命令和一些特殊的变量 who:查看有哪些变量1. whos:可以查看变量的大小.字节和类型等资料. clear:如果单独使用则是清空所有命令,若后面跟着一个变量名称则为删除此变量. clc:清空命令行 ...
- RabbitMQ的五种工作方式详细
在了解之前得先有个RabbitMQ客户端.官网: https://www.rabbitmq.com/getstarted.html connections:无论生产者还是消费者,都需要与RabbitM ...
- python3练习100题——045
题目:统计 1 到 100 之和. sum(range(1,101)) 题目太容易了,我都不想用迭代浪费时间. 觉得这100道题难度设计越来越不合理.
- mysql空数据的处理
1.统计分析时,统计值为null则转为0 //统计婚姻接口调用次数select count ,(zsj/count) as pjdysjfrom(-- 实时调用量 评论返回时间差(取平均值)selec ...
- 851. spfa求最短路(spfa算法模板)
给定一个n个点m条边的有向图,图中可能存在重边和自环, 边权可能为负数. 请你求出1号点到n号点的最短距离,如果无法从1号点走到n号点,则输出impossible. 数据保证不存在负权回路. 输入格式 ...
- Luogu1287 | 盒子与球 (排列组合)
贴一个和其他题解不一样的做法 QWQ 题意:让我们求出 N 个球放入 R 个盒子且每个盒子都必须放球方案数. 首先,对于每一个球,可以将其放入的盒子数量共有 R 个,所以我们可以知道如果无需满足每个盒 ...
- Codeforce 25A - IQ test (唯一奇偶)
Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of th ...
- [Agc005D/At2060] Minimum Sum - 单调栈
鉴于早上那题让我怀疑单调栈白学,特意来复习下单调栈 题意 考虑按照每个元素对答案的贡献来统计,那么我们只需要找到每个元素左边右边第一个比它小的就可 这题给的又是排列,简直不能再良心 #include ...
- [HNOI2003] 消防局的设立 - 树形dp
仍然是点覆盖集问题,但覆盖半径变成了\(2\) 延续上一题的思路,只是式子更加复杂了 想体验一下min_element大法于是不想优化了 #include <bits/stdc++.h> ...
- Session方法
Session的save()和persist()方法Session的save()方法使一个临时对象转变为持久化对象.它完成以下操作:(1)将临时对象加入到Session缓存中,使其进入持久化状态.(2 ...