pcb-tools-extension/gerberex/dxf_path.py
Hiroshi Murayama fc3f1a23b8 improve DXF file handling functions:
- DM_LINE mode support to generate Excellon routing sequence
- DM_MOUSE_BITES mode support to generate mouse bites along all path also,  not only line object
2019-09-28 17:40:09 +09:00

287 lines
11 KiB
Python

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# Copyright 2019 Hiroshi Murayama <opiopan@gmail.com>
from gerber.utils import inch, metric, write_gerber_value
from gerber.cam import FileSettings
from gerberex.utility import is_equal_point, is_equal_value
from gerberex.excellon import CoordinateStmtEx
class DxfPath(object):
def __init__(self, statements, error_range=0):
self.statements = statements
self.error_range = error_range
@property
def start(self):
return self.statements[0].start
@property
def end(self):
return self.statements[-1].end
@property
def is_closed(self):
if len(self.statements) == 1:
return self.statements[0].is_closed
else:
return is_equal_point(self.start, self.end, self.error_range)
def is_equal_to(self, target, error_range=0):
if not isinstance(target, DxfPath):
return False
if len(self.statements) != len(target.statements):
return False
if is_equal_point(self.start, target.start, error_range) and \
is_equal_point(self.end, target.end, error_range):
for i in range(0, len(self.statements)):
if not self.statements[i].is_equal_to(target.statements[i], error_range):
return False
return True
elif is_equal_point(self.start, target.end, error_range) and \
is_equal_point(self.end, target.start, error_range):
for i in range(0, len(self.statements)):
if not self.statements[i].is_equal_to(target.statements[-1 - i], error_range):
return False
return True
return False
def contain(self, target, error_range=0):
for statement in self.statements:
if statement.is_equal_to(target, error_range):
return True
else:
return False
def to_inch(self):
self.error_range = inch(self.error_range)
for statement in self.statements:
statement.to_inch()
def to_metric(self):
self.error_range = metric(self.error_range)
for statement in self.statements:
statement.to_metric()
def offset(self, offset_x, offset_y):
for statement in self.statements:
statement.offset(offset_x, offset_y)
def rotate(self, angle, center=(0, 0)):
for statement in self.statements:
statement.rotate(angle, center)
def reverse(self):
rlist = []
for statement in reversed(self.statements):
statement.reverse()
rlist.append(statement)
self.statements = rlist
def merge(self, element, error_range=0):
if self.is_closed or element.is_closed:
return False
if not error_range:
error_range = self.error_range
if is_equal_point(self.end, element.start, error_range):
return self._append_at_end(element, error_range)
elif is_equal_point(self.end, element.end, error_range):
element.reverse()
return self._append_at_end(element, error_range)
elif is_equal_point(self.start, element.end, error_range):
return self._insert_on_top(element, error_range)
elif is_equal_point(self.start, element.start, error_range):
element.reverse()
return self._insert_on_top(element, error_range)
else:
return False
def _append_at_end(self, element, error_range=0):
if isinstance(element, DxfPath):
if self.is_equal_to(element, error_range):
return False
for i in range(0, min(len(self.statements), len(element.statements))):
if not self.statements[-1 - i].is_equal_to(element.statements[i]):
break
for j in range(0, min(len(self.statements), len(element.statements))):
if not self.statements[j].is_equal_to(element.statements[-1 - j]):
break
if i + j >= len(element.statements):
return False
mergee = list(element.statements)
if i > 0:
del mergee[0:i]
del self.statements[-i]
if j > 0:
del mergee[-j]
del self.statements[0:j]
self.statements.extend(mergee)
return True
else:
if self.statements[-1].is_equal_to(element, error_range) or \
self.statements[0].is_equal_to(element, error_range):
return False
self.statements.appen(element)
return True
def _insert_on_top(self, element, error_range=0):
if isinstance(element, DxfPath):
if self.is_equal_to(element, error_range):
return False
for i in range(0, min(len(self.statements), len(element.statements))):
if not self.statements[-1 - i].is_equal_to(element.statements[i]):
break
for j in range(0, min(len(self.statements), len(element.statements))):
if not self.statements[j].is_equal_to(element.statements[-1 - j]):
break
if i + j >= len(element.statements):
return False
mergee = list(element.statements)
if i > 0:
del mergee[0:i]
del self.statements[-i]
if j > 0:
del mergee[-j]
del self.statements[0:j]
self.statements[0:0] = mergee
return True
else:
if self.statements[-1].is_equal_to(element, error_range) or \
self.statements[0].is_equal_to(element, error_range):
return False
self.statements.insert(0, element)
return True
def to_gerber(self, settings=FileSettings(), pitch=0, width=0):
from gerberex.dxf import DxfArcStatement
if pitch == 0:
x0, y0 = self.statements[0].start
gerber = 'G01*\nX{0}Y{1}D02*\nG75*'.format(
write_gerber_value(x0, settings.format,
settings.zero_suppression),
write_gerber_value(y0, settings.format,
settings.zero_suppression),
)
for statement in self.statements:
x0, y0 = statement.start
x1, y1 = statement.end
if isinstance(statement, DxfArcStatement):
xc, yc = statement.center
gerber += '\nG{0}*\nX{1}Y{2}I{3}J{4}D01*'.format(
'03' if statement.end_angle > statement.start_angle else '02',
write_gerber_value(x1, settings.format,
settings.zero_suppression),
write_gerber_value(y1, settings.format,
settings.zero_suppression),
write_gerber_value(xc - x0, settings.format,
settings.zero_suppression),
write_gerber_value(yc - y0, settings.format,
settings.zero_suppression)
)
else:
gerber += '\nG01*\nX{0}Y{1}D01*'.format(
write_gerber_value(x1, settings.format,
settings.zero_suppression),
write_gerber_value(y1, settings.format,
settings.zero_suppression),
)
else:
def ploter(x, y):
return 'X{0}Y{1}D03*\n'.format(
write_gerber_value(x, settings.format,
settings.zero_suppression),
write_gerber_value(y, settings.format,
settings.zero_suppression),
)
gerber = self._plot_dots(pitch, width, ploter)
return gerber
def to_excellon(self, settings=FileSettings(), pitch=0, width=0):
from gerberex.dxf import DxfArcStatement
if pitch == 0:
x, y = self.statements[0].start
excellon = 'G00{0}\nM15\n'.format(
CoordinateStmtEx(x=x, y=y).to_excellon(settings))
for statement in self.statements:
x, y = statement.end
if isinstance(statement, DxfArcStatement):
r = statement.radius
excellon += '{0}{1}\n'.format(
'G03' if statement.end_angle > statement.start_angle else 'G02',
CoordinateStmtEx(x=x, y=y, radius=r).to_excellon(settings))
else:
excellon += 'G01{0}\n'.format(
CoordinateStmtEx(x=x, y=y).to_excellon(settings))
excellon += 'M16\nG05\n'
else:
def ploter(x, y):
return CoordinateStmtEx(x=x, y=y).to_excellon(settings) + '\n'
excellon = self._plot_dots(pitch, width, ploter)
return excellon
def _plot_dots(self, pitch, width, ploter):
out = ''
offset = 0
for idx in range(0, len(self.statements)):
statement = self.statements[idx]
if offset < 0:
offset += pitch
for dot, offset in statement.dots(pitch, width, offset):
if dot is None:
break
if offset > 0 and (statement.is_closed or idx != len(self.statements) - 1):
break
#if idx == len(self.statements) - 1 and statement.is_closed and offset > -pitch:
# break
out += ploter(dot[0], dot[1])
return out
def generate_paths(statements, error_range=0):
from gerberex.dxf import DxfPolylineStatement
paths = []
for statement in filter(lambda s: isinstance(s, DxfPolylineStatement), statements):
units = [unit for unit in statement.disassemble()]
paths.append(DxfPath(units, error_range))
unique_statements = []
redundant = 0
for statement in filter(lambda s: not isinstance(s, DxfPolylineStatement), statements):
for path in paths:
if path.contain(statement):
redundant += 1
break
else:
for target in unique_statements:
if statement.is_equal_to(target, error_range):
redundant += 1
break
else:
unique_statements.append(statement)
paths.extend([DxfPath([s], error_range) for s in unique_statements])
prev_paths_num = 0
while prev_paths_num != len(paths):
working = []
for i in range(len(paths)):
mergee = paths[i]
for j in range(i + 1, len(paths)):
target = paths[j]
if target.merge(mergee, error_range):
break
else:
working.append(mergee)
prev_paths_num = len(paths)
paths = working
closed_path = list(filter(lambda p: p.is_closed, paths))
open_path = list(filter(lambda p: not p.is_closed, paths))
return (closed_path, open_path)